YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:42:08,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:42:08,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:42:08,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:42:08,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:42:08,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:42:08,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:42:08,145 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:42:08,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:42:08,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:42:08,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:42:08,149 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:42:08,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:42:08,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:42:08,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:42:08,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:42:08,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:42:08,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:42:08,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:42:08,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:42:08,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:42:08,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:42:08,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:42:08,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:42:08,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:42:08,163 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:42:08,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:42:08,164 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:42:08,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:42:08,165 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:42:08,166 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:42:08,166 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:42:08,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:42:08,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:42:08,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:42:08,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:42:08,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:42:08,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:42:08,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:42:08,170 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:42:08,185 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:42:08,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:42:08,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:42:08,186 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:42:08,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:42:08,187 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:42:08,187 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:42:08,187 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:42:08,187 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:42:08,188 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:42:08,188 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:42:08,188 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:42:08,188 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:42:08,188 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:42:08,188 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:42:08,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:42:08,189 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:42:08,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:42:08,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:42:08,189 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:42:08,189 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:42:08,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:42:08,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:42:08,190 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:42:08,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:42:08,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:42:08,191 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:42:08,191 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:42:08,191 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:42:08,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:42:08,230 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:42:08,234 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:42:08,235 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:42:08,236 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:42:08,237 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:42:08,308 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/953671e193a8440987913e336d3e2b5a/FLAG8accf1ad4 [2020-06-22 10:42:08,649 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:42:08,649 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:42:08,650 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:42:08,656 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/953671e193a8440987913e336d3e2b5a/FLAG8accf1ad4 [2020-06-22 10:42:09,068 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/953671e193a8440987913e336d3e2b5a [2020-06-22 10:42:09,079 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:42:09,081 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:42:09,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:42:09,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:42:09,086 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:42:09,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7afdc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09, skipping insertion in model container [2020-06-22 10:42:09,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:42:09,116 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:42:09,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:42:09,355 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:42:09,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:42:09,390 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:42:09,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09 WrapperNode [2020-06-22 10:42:09,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:42:09,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:42:09,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:42:09,391 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:42:09,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:42:09,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:42:09,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:42:09,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:42:09,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:42:09,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:42:09,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:42:09,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:42:09,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:42:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:42:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:42:09,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:42:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:42:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:42:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:42:09,783 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:42:09,783 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:42:09,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:09 BoogieIcfgContainer [2020-06-22 10:42:09,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:42:09,785 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:42:09,786 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:42:09,787 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:42:09,788 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:09" (1/1) ... [2020-06-22 10:42:09,806 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 41 edges [2020-06-22 10:42:09,808 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:42:09,808 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:42:09,809 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:42:09,809 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:42:09,811 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:42:09,812 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:42:09,812 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:42:09,836 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:42:09,876 INFO L200 BlockEncoder]: SBE split 21 edges [2020-06-22 10:42:09,881 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:42:09,883 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:42:09,920 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:42:09,923 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:42:09,925 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:42:09,926 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:42:09,926 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:42:09,927 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:42:09,927 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 60 edges [2020-06-22 10:42:09,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:09 BasicIcfg [2020-06-22 10:42:09,928 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:42:09,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:42:09,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:42:09,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:42:09,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:42:09" (1/4) ... [2020-06-22 10:42:09,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f36ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:42:09, skipping insertion in model container [2020-06-22 10:42:09,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (2/4) ... [2020-06-22 10:42:09,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f36ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:42:09, skipping insertion in model container [2020-06-22 10:42:09,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:09" (3/4) ... [2020-06-22 10:42:09,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f36ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:09, skipping insertion in model container [2020-06-22 10:42:09,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:09" (4/4) ... [2020-06-22 10:42:09,937 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:42:09,947 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:42:09,955 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-06-22 10:42:09,972 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-06-22 10:42:10,001 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:42:10,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:42:10,002 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:42:10,002 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:42:10,003 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:42:10,003 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:42:10,003 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:42:10,003 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:42:10,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:42:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-06-22 10:42:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:42:10,025 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:42:10,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,031 INFO L82 PathProgramCache]: Analyzing trace with hash 112313, now seen corresponding path program 1 times [2020-06-22 10:42:10,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:10,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:10,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:10,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:10,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,239 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-06-22 10:42:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:10,394 INFO L93 Difference]: Finished difference Result 33 states and 60 transitions. [2020-06-22 10:42:10,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:10,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:42:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:10,411 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:42:10,411 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:42:10,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:42:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:42:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:42:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. [2020-06-22 10:42:10,457 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 3 [2020-06-22 10:42:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:10,458 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 56 transitions. [2020-06-22 10:42:10,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. [2020-06-22 10:42:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:42:10,458 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:42:10,459 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash 112315, now seen corresponding path program 1 times [2020-06-22 10:42:10,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:10,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:10,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:10,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:10,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,496 INFO L87 Difference]: Start difference. First operand 31 states and 56 transitions. Second operand 3 states. [2020-06-22 10:42:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:10,582 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2020-06-22 10:42:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:10,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:42:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:10,583 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:42:10,583 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 10:42:10,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 10:42:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 10:42:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:42:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2020-06-22 10:42:10,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 [2020-06-22 10:42:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:10,590 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2020-06-22 10:42:10,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2020-06-22 10:42:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:42:10,591 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:42:10,591 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash 112316, now seen corresponding path program 1 times [2020-06-22 10:42:10,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:10,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:10,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:10,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:10,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,630 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. [2020-06-22 10:42:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:10,737 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2020-06-22 10:42:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:10,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:42:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:10,738 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:42:10,739 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:42:10,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:42:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:42:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:42:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. [2020-06-22 10:42:10,744 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 3 [2020-06-22 10:42:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:10,744 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 52 transitions. [2020-06-22 10:42:10,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 52 transitions. [2020-06-22 10:42:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:42:10,745 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:42:10,745 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash 3480560, now seen corresponding path program 1 times [2020-06-22 10:42:10,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:10,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:10,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,783 INFO L87 Difference]: Start difference. First operand 29 states and 52 transitions. Second operand 3 states. [2020-06-22 10:42:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:10,869 INFO L93 Difference]: Finished difference Result 29 states and 52 transitions. [2020-06-22 10:42:10,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:10,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:42:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:10,870 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:42:10,871 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:42:10,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:42:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:42:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:42:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2020-06-22 10:42:10,875 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 4 [2020-06-22 10:42:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:10,875 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. [2020-06-22 10:42:10,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. [2020-06-22 10:42:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:42:10,876 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:42:10,876 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 3480562, now seen corresponding path program 1 times [2020-06-22 10:42:10,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:10,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:10,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:10,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,904 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. [2020-06-22 10:42:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:10,980 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. [2020-06-22 10:42:10,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:10,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:42:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:10,981 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:42:10,981 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:42:10,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:42:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:42:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:42:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2020-06-22 10:42:10,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 4 [2020-06-22 10:42:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:10,986 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2020-06-22 10:42:10,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2020-06-22 10:42:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:42:10,987 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:10,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:42:10,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 3480563, now seen corresponding path program 1 times [2020-06-22 10:42:10,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:11,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,033 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 3 states. [2020-06-22 10:42:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,109 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. [2020-06-22 10:42:11,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:42:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,110 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:42:11,110 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:42:11,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:42:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:42:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:42:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-06-22 10:42:11,115 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 [2020-06-22 10:42:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,115 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-06-22 10:42:11,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-06-22 10:42:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:42:11,116 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:42:11,116 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 107895973, now seen corresponding path program 1 times [2020-06-22 10:42:11,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:11,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,151 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. [2020-06-22 10:42:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,205 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 10:42:11,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:42:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,206 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:42:11,207 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:42:11,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:42:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:42:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:42:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2020-06-22 10:42:11,210 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 [2020-06-22 10:42:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,210 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 10:42:11,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. [2020-06-22 10:42:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:42:11,211 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:42:11,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:42:11,211 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 10:42:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash 107895975, now seen corresponding path program 1 times [2020-06-22 10:42:11,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:11,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:42:11,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:42:11,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:42:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:42:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,251 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. [2020-06-22 10:42:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:42:11,307 INFO L93 Difference]: Finished difference Result 17 states and 28 transitions. [2020-06-22 10:42:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:42:11,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:42:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:42:11,308 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:42:11,308 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:42:11,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:42:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:42:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:42:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:42:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:42:11,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 10:42:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:42:11,309 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:42:11,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:42:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:42:11,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:42:11,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:42:11,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:42:11,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:42:11,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:42:11,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:42:11,345 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:42:11,346 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 10:42:11,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:42:11,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,347 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,348 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,348 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:42:11,348 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:42:11,348 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:42:11,348 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:42:11,348 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:42:11,348 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,349 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 10:42:11,349 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 17) no Hoare annotation was computed. [2020-06-22 10:42:11,349 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:42:11,349 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 13 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~r_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~r_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~r_ref~0.base))) [2020-06-22 10:42:11,349 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 14 17) no Hoare annotation was computed. [2020-06-22 10:42:11,350 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:42:11,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:42:11,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:11 BasicIcfg [2020-06-22 10:42:11,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:42:11,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:42:11,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:42:11,373 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:42:11,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:42:09" (1/5) ... [2020-06-22 10:42:11,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb5003a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:42:09" (2/5) ... [2020-06-22 10:42:11,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb5003a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:42:09" (3/5) ... [2020-06-22 10:42:11,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb5003a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:42:09" (4/5) ... [2020-06-22 10:42:11,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb5003a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:42:11, skipping insertion in model container [2020-06-22 10:42:11,377 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:42:11,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:42:11" (5/5) ... [2020-06-22 10:42:11,378 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:42:11,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:42:11,400 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:42:11,400 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:42:11,400 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:42:11,400 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:42:11,400 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:42:11,400 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:42:11,400 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:42:11,400 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:42:11,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 10:42:11,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:42:11,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:11,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:11,414 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:42:11,414 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,414 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:42:11,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 10:42:11,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:42:11,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:42:11,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:42:11,417 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:42:11,417 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:42:11,422 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [82] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [123] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet8_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~r_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~r_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~r_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~r_1 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#in~r=|v_ULTIMATE.start_test_fun_#in~r_1|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_1, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~r, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#in~r, ULTIMATE.start_test_fun_~r_ref~0.offset, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_~r_ref~0.base, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset] 29#L11true [83] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 26#L11-1true [79] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 14#L12true [65] L12-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_test_fun_~r_ref~0.base_3) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~r_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~r_ref~0.base_3) v_ULTIMATE.start_test_fun_~r_ref~0.offset_3 v_ULTIMATE.start_test_fun_~r_4))) (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~r_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_3, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_3, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 15#L14-2true [2020-06-22 10:42:11,423 INFO L796 eck$LassoCheckResult]: Loop: 15#L14-2true [69] L14-2-->L14: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 18#L14true [74] L14-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 20#L15true [76] L15-->L15-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~r_ref~0.base_6) v_ULTIMATE.start_test_fun_~r_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~r_ref~0.base_6)) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~r_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_6, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_5, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 35#L15-1true [91] L15-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 33#L15-2true [166] L15-2-->L16: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_13 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~r_ref~0.base_17)) (= (store |v_#memory_int_19| v_ULTIMATE.start_test_fun_~r_ref~0.base_17 (store (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~r_ref~0.base_17) v_ULTIMATE.start_test_fun_~r_ref~0.offset_13 (* |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|))) |v_#memory_int_18|) (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_13) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~r_ref~0.base_17))) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_13, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_17} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_13, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_18|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, #memory_int] 5#L16true [56] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 4#L16-1true [169] L16-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_40| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (= (store |v_#memory_int_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 15#L14-2true [2020-06-22 10:42:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash 108104443, now seen corresponding path program 1 times [2020-06-22 10:42:11,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash 747672066, now seen corresponding path program 1 times [2020-06-22 10:42:11,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,480 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:42:11,480 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:42:11,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:42:11,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:11,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash 152410568, now seen corresponding path program 1 times [2020-06-22 10:42:11,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:42:11,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:42:11,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:42:11,573 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:42:11,574 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:42:11,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:42:11,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:42:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:42:12,195 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2020-06-22 10:42:12,350 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-06-22 10:42:12,364 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:42:12,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:42:12,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:42:12,366 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:42:12,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:42:12,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:42:12,367 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:42:12,367 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:42:12,367 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:42:12,367 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:42:12,367 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:42:12,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,788 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-06-22 10:42:12,899 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 10:42:12,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:12,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:42:13,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:42:13,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:42:13,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:42:13,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:42:13,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:42:13,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:42:13,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:42:13,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:42:13,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:42:13,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:42:13,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:42:13,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:42:13,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:42:13,389 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:42:13,407 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:42:13,407 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:42:13,409 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:42:13,411 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:42:13,411 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:42:13,412 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 10:42:13,493 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 10:42:13,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:42:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:42:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:13,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:42:13,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:13,583 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-06-22 10:42:13,583 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:13,590 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:13,591 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:42:13,591 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2020-06-22 10:42:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:13,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:13,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:13,650 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-06-22 10:42:13,651 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:13,662 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:13,663 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:42:13,664 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:31 [2020-06-22 10:42:23,700 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 23 [2020-06-22 10:42:28,735 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 25 [2020-06-22 10:42:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:42:33,807 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_test_fun_#t~mem4_12| Int) (|v_ULTIMATE.start_test_fun_#t~mem5_12| Int) (ULTIMATE.start_test_fun_~r_ref~0.offset Int)) (= (* |v_ULTIMATE.start_test_fun_#t~mem4_12| |v_ULTIMATE.start_test_fun_#t~mem5_12|) (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~r_ref~0.base) ULTIMATE.start_test_fun_~r_ref~0.offset))) is different from true [2020-06-22 10:42:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:42:33,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:42:33,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:42:33,854 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:42:33,855 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:33,862 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:33,863 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:42:33,863 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:24 [2020-06-22 10:42:53,933 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 21 [2020-06-22 10:42:58,967 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 23 [2020-06-22 10:42:58,974 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2020-06-22 10:42:58,987 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:42:58,998 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:42:58,999 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:42:58,999 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 [2020-06-22 10:43:04,030 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 23 [2020-06-22 10:43:09,065 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 25 [2020-06-22 10:43:14,102 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 24 [2020-06-22 10:43:19,106 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_test_fun_#t~mem5_13| Int) (|v_ULTIMATE.start_test_fun_#t~mem4_13| Int) (ULTIMATE.start_test_fun_~r_ref~0.offset Int)) (= (* |v_ULTIMATE.start_test_fun_#t~mem4_13| |v_ULTIMATE.start_test_fun_#t~mem5_13|) (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~r_ref~0.base) ULTIMATE.start_test_fun_~r_ref~0.offset))) is different from true [2020-06-22 10:43:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:19,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:43:19,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:19,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-06-22 10:43:19,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:19,147 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:19,147 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:43:19,148 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:24 [2020-06-22 10:43:34,185 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2020-06-22 10:43:34,186 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:34,197 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:34,198 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:43:34,198 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:26 [2020-06-22 10:43:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:43:34,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:43:34,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:43:44,280 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2020-06-22 10:43:44,280 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:43:44,287 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:43:44,288 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:43:44,288 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2020-06-22 10:44:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:29,445 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:44:29,445 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 10:44:29,449 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 9 loop predicates [2020-06-22 10:44:29,449 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states. Second operand 7 states. [2020-06-22 10:45:00,058 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states.. Second operand 7 states. Result 55 states and 105 transitions. Complement of second has 11 states. [2020-06-22 10:45:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:45:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:45:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2020-06-22 10:45:00,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 97 transitions. Stem has 5 letters. Loop has 7 letters. [2020-06-22 10:45:00,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:45:00,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 97 transitions. Stem has 12 letters. Loop has 7 letters. [2020-06-22 10:45:00,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:45:00,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 97 transitions. Stem has 5 letters. Loop has 14 letters. [2020-06-22 10:45:00,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:45:00,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 105 transitions. [2020-06-22 10:45:00,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:45:00,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2020-06-22 10:45:00,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:45:00,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:45:00,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:45:00,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:45:00,078 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:45:00,078 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:45:00,078 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:45:00,078 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:45:00,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:45:00,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:45:00,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:45:00,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:45:00 BasicIcfg [2020-06-22 10:45:00,084 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:45:00,084 INFO L168 Benchmark]: Toolchain (without parser) took 171004.44 ms. Allocated memory was 649.6 MB in the beginning and 774.4 MB in the end (delta: 124.8 MB). Free memory was 564.2 MB in the beginning and 586.1 MB in the end (delta: -22.0 MB). Peak memory consumption was 102.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:45:00,085 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:45:00,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.70 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 564.2 MB in the beginning and 653.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:45:00,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 689.4 MB. Free memory was 653.5 MB in the beginning and 651.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:45:00,087 INFO L168 Benchmark]: Boogie Preprocessor took 23.98 ms. Allocated memory is still 689.4 MB. Free memory was 651.4 MB in the beginning and 649.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:45:00,087 INFO L168 Benchmark]: RCFGBuilder took 329.18 ms. Allocated memory is still 689.4 MB. Free memory was 649.2 MB in the beginning and 626.9 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:45:00,088 INFO L168 Benchmark]: BlockEncodingV2 took 142.79 ms. Allocated memory is still 689.4 MB. Free memory was 626.9 MB in the beginning and 616.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:45:00,088 INFO L168 Benchmark]: TraceAbstraction took 1439.49 ms. Allocated memory is still 689.4 MB. Free memory was 616.1 MB in the beginning and 456.0 MB in the end (delta: 160.1 MB). Peak memory consumption was 160.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:45:00,089 INFO L168 Benchmark]: BuchiAutomizer took 168713.82 ms. Allocated memory was 689.4 MB in the beginning and 774.4 MB in the end (delta: 84.9 MB). Free memory was 455.0 MB in the beginning and 586.1 MB in the end (delta: -131.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:45:00,093 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 41 edges - StatisticsResult: Encoded RCFG 33 locations, 60 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 308.70 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 564.2 MB in the beginning and 653.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 689.4 MB. Free memory was 653.5 MB in the beginning and 651.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.98 ms. Allocated memory is still 689.4 MB. Free memory was 651.4 MB in the beginning and 649.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 329.18 ms. Allocated memory is still 689.4 MB. Free memory was 649.2 MB in the beginning and 626.9 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 142.79 ms. Allocated memory is still 689.4 MB. Free memory was 626.9 MB in the beginning and 616.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1439.49 ms. Allocated memory is still 689.4 MB. Free memory was 616.1 MB in the beginning and 456.0 MB in the end (delta: 160.1 MB). Peak memory consumption was 160.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 168713.82 ms. Allocated memory was 689.4 MB in the beginning and 774.4 MB in the end (delta: 84.9 MB). Free memory was 455.0 MB in the beginning and 586.1 MB in the end (delta: -131.2 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-06-22 10:45:00,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:45:00,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:45:00,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:45:00,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:45:00,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:45:00,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == r_ref) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[r_ref]) && 1 == \valid[r_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 20 error locations. SAFE Result, 1.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 251 SDslu, 5 SDs, 0 SdLazy, 305 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 168.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 166.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4 SDtfs, 284 SDslu, 31 SDs, 0 SdLazy, 242 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital320 mio100 ax100 hnf100 lsp97 ukn59 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:42:05.831 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:45:00.331 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check