./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array13_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array13_alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:20:44,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:20:44,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:20:44,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:20:44,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:20:44,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:20:44,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:20:44,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:20:44,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:20:44,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:20:44,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:20:44,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:20:44,993 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:20:44,993 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:20:44,995 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:20:44,996 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:20:44,996 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:20:44,996 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:20:44,996 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:20:44,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:20:44,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:20:44,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:20:44,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:20:44,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:20:44,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:20:44,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:20:44,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:20:44,998 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:20:44,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:20:44,998 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:20:44,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:20:44,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:20:44,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:20:44,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:20:44,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:20:44,999 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:20:44,999 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2024-10-12 00:20:45,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:20:45,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:20:45,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:20:45,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:20:45,228 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:20:45,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array13_alloca.i [2024-10-12 00:20:46,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:20:46,723 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:20:46,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array13_alloca.i [2024-10-12 00:20:46,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2028c1c03/59a19f05e1d24cb891c7d21ee343c37d/FLAG2ab684a46 [2024-10-12 00:20:46,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2028c1c03/59a19f05e1d24cb891c7d21ee343c37d [2024-10-12 00:20:46,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:20:46,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:20:46,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:20:46,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:20:46,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:20:46,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:20:46" (1/1) ... [2024-10-12 00:20:46,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360c07ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:46, skipping insertion in model container [2024-10-12 00:20:46,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:20:46" (1/1) ... [2024-10-12 00:20:46,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:20:47,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:20:47,037 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:20:47,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:20:47,107 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:20:47,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47 WrapperNode [2024-10-12 00:20:47,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:20:47,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:20:47,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:20:47,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:20:47,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,147 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-10-12 00:20:47,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:20:47,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:20:47,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:20:47,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:20:47,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,174 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-12 00:20:47,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:20:47,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:20:47,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:20:47,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:20:47,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (1/1) ... [2024-10-12 00:20:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:47,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:47,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:20:47,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:20:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:20:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:20:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:20:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:20:47,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:20:47,342 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:20:47,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:20:47,442 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 00:20:47,442 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:20:47,453 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:20:47,454 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:20:47,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:20:47 BoogieIcfgContainer [2024-10-12 00:20:47,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:20:47,455 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:20:47,455 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:20:47,458 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:20:47,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:20:47,459 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:20:46" (1/3) ... [2024-10-12 00:20:47,460 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d4c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:20:47, skipping insertion in model container [2024-10-12 00:20:47,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:20:47,460 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:20:47" (2/3) ... [2024-10-12 00:20:47,460 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d4c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:20:47, skipping insertion in model container [2024-10-12 00:20:47,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:20:47,460 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:20:47" (3/3) ... [2024-10-12 00:20:47,462 INFO L332 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2024-10-12 00:20:47,506 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:20:47,507 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:20:47,507 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:20:47,507 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:20:47,507 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:20:47,507 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:20:47,507 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:20:47,508 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:20:47,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:47,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-10-12 00:20:47,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:47,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:47,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:20:47,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:20:47,532 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:20:47,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:47,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-10-12 00:20:47,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:47,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:47,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:20:47,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:20:47,543 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2024-10-12 00:20:47,543 INFO L747 eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 4#L370-3true [2024-10-12 00:20:47,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-10-12 00:20:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520972052] [2024-10-12 00:20:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:47,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:47,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:47,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2024-10-12 00:20:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:47,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573990005] [2024-10-12 00:20:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:47,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:47,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2024-10-12 00:20:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704120172] [2024-10-12 00:20:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:47,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:47,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:48,064 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:20:48,064 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:20:48,065 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:20:48,065 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:20:48,065 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:20:48,065 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:48,065 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:20:48,065 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:20:48,065 INFO L132 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2024-10-12 00:20:48,065 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:20:48,065 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:20:48,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:48,421 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:20:48,425 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:20:48,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:48,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:48,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:20:48,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:20:48,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:48,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:48,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:48,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:48,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:48,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:48,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:48,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:48,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:20:48,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:48,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:48,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:20:48,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:20:48,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:48,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:48,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:48,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:48,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:48,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:48,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:48,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:48,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:20:48,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:48,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:48,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:48,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:20:48,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:20:48,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:48,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:48,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:48,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:48,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:48,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:48,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:48,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:20:48,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:48,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:48,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:48,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:20:48,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:20:48,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:48,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:48,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:48,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:48,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:48,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:48,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:48,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:20:48,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:48,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:48,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:20:48,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:20:48,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:48,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:48,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:48,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:48,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:48,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:48,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:20:48,628 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-12 00:20:48,629 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-12 00:20:48,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:48,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:48,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:48,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:20:48,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:20:48,650 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:20:48,650 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:20:48,651 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:20:48,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:48,676 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-12 00:20:48,685 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:20:48,685 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:20:48,689 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-10-12 00:20:48,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:48,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:20:48,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:48,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:20:48,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:48,816 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:20:48,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:48,861 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 40 transitions. Complement of second has 6 states. [2024-10-12 00:20:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:20:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-10-12 00:20:48,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-12 00:20:48,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:48,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 3 letters. [2024-10-12 00:20:48,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:48,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 6 letters. [2024-10-12 00:20:48,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:48,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2024-10-12 00:20:48,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:48,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 12 states and 17 transitions. [2024-10-12 00:20:48,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:20:48,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:20:48,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2024-10-12 00:20:48,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:48,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-12 00:20:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2024-10-12 00:20:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 00:20:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-10-12 00:20:48,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-12 00:20:48,901 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-12 00:20:48,901 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:20:48,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2024-10-12 00:20:48,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:48,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:48,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:48,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:48,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:48,904 INFO L745 eck$LassoCheckResult]: Stem: 109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 111#L367 assume !(main_~length~0#1 < 1); 103#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 104#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 105#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 108#L370-4 main_~j~0#1 := 0; 107#L378-2 [2024-10-12 00:20:48,904 INFO L747 eck$LassoCheckResult]: Loop: 107#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 106#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 107#L378-2 [2024-10-12 00:20:48,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2024-10-12 00:20:48,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:48,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453004747] [2024-10-12 00:20:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:48,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:49,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453004747] [2024-10-12 00:20:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453004747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:20:49,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:20:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:20:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529629297] [2024-10-12 00:20:49,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:20:49,057 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:20:49,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2024-10-12 00:20:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871706325] [2024-10-12 00:20:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:49,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:20:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:20:49,121 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:49,146 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-12 00:20:49,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2024-10-12 00:20:49,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:49,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2024-10-12 00:20:49,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:20:49,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:20:49,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-10-12 00:20:49,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:49,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-12 00:20:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-10-12 00:20:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2024-10-12 00:20:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-10-12 00:20:49,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:20:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:20:49,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:20:49,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:20:49,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-10-12 00:20:49,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:49,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:49,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:49,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:49,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:49,156 INFO L745 eck$LassoCheckResult]: Stem: 142#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 144#L367 assume !(main_~length~0#1 < 1); 136#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 137#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 138#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 145#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 147#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 146#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 139#L370-4 main_~j~0#1 := 0; 140#L378-2 [2024-10-12 00:20:49,156 INFO L747 eck$LassoCheckResult]: Loop: 140#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 141#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 140#L378-2 [2024-10-12 00:20:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2024-10-12 00:20:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084463093] [2024-10-12 00:20:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:49,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2024-10-12 00:20:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297622805] [2024-10-12 00:20:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:49,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2024-10-12 00:20:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419236063] [2024-10-12 00:20:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:49,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419236063] [2024-10-12 00:20:49,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419236063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:49,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397403777] [2024-10-12 00:20:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:49,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:49,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:49,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 00:20:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:49,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:20:49,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:49,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:20:49,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-10-12 00:20:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:49,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:49,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2024-10-12 00:20:49,700 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 16 [2024-10-12 00:20:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:49,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397403777] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:49,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:49,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2024-10-12 00:20:49,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073313541] [2024-10-12 00:20:49,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:49,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 00:20:49,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-12 00:20:49,747 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:49,850 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2024-10-12 00:20:49,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2024-10-12 00:20:49,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:20:49,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2024-10-12 00:20:49,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:20:49,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:20:49,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2024-10-12 00:20:49,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:49,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-12 00:20:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2024-10-12 00:20:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-10-12 00:20:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2024-10-12 00:20:49,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-10-12 00:20:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:20:49,857 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-10-12 00:20:49,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:20:49,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2024-10-12 00:20:49,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:49,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:49,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:49,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:49,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:49,861 INFO L745 eck$LassoCheckResult]: Stem: 267#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 269#L367 assume !(main_~length~0#1 < 1); 261#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 262#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 263#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 270#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 274#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 271#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 272#L370-4 main_~j~0#1 := 0; 275#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 266#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 265#L378-2 [2024-10-12 00:20:49,861 INFO L747 eck$LassoCheckResult]: Loop: 265#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 278#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 265#L378-2 [2024-10-12 00:20:49,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2024-10-12 00:20:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174368325] [2024-10-12 00:20:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2024-10-12 00:20:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075429971] [2024-10-12 00:20:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:49,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:49,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:49,888 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2024-10-12 00:20:49,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:49,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124662745] [2024-10-12 00:20:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124662745] [2024-10-12 00:20:49,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124662745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:49,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227504009] [2024-10-12 00:20:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:49,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:49,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:49,950 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:49,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 00:20:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:49,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:20:49,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:50,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:50,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227504009] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:50,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:50,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-12 00:20:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355171566] [2024-10-12 00:20:50,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:20:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:20:50,093 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:50,161 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-10-12 00:20:50,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2024-10-12 00:20:50,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:20:50,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2024-10-12 00:20:50,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:20:50,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:20:50,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2024-10-12 00:20:50,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:50,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-10-12 00:20:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2024-10-12 00:20:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2024-10-12 00:20:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-10-12 00:20:50,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-10-12 00:20:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:20:50,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-10-12 00:20:50,173 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:20:50,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2024-10-12 00:20:50,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:20:50,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:50,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:50,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:50,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:50,178 INFO L745 eck$LassoCheckResult]: Stem: 430#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 431#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 432#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 423#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 424#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 425#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 455#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 453#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 454#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 452#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 450#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 447#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 426#L370-4 main_~j~0#1 := 0; 427#L378-2 [2024-10-12 00:20:50,178 INFO L747 eck$LassoCheckResult]: Loop: 427#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 439#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 427#L378-2 [2024-10-12 00:20:50,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2024-10-12 00:20:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783409364] [2024-10-12 00:20:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783409364] [2024-10-12 00:20:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783409364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860397194] [2024-10-12 00:20:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:50,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:50,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 00:20:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:50,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:20:50,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:50,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:20:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860397194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:20:50,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:20:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-12 00:20:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385619457] [2024-10-12 00:20:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:20:50,326 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:20:50,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2024-10-12 00:20:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:50,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015378377] [2024-10-12 00:20:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:50,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:50,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:50,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:50,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:20:50,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:20:50,377 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:50,391 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-10-12 00:20:50,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2024-10-12 00:20:50,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:50,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2024-10-12 00:20:50,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:20:50,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:20:50,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-10-12 00:20:50,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:50,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-12 00:20:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-10-12 00:20:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-12 00:20:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-12 00:20:50,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-12 00:20:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:20:50,395 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-12 00:20:50,395 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:20:50,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-10-12 00:20:50,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:50,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:50,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:50,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:50,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:50,397 INFO L745 eck$LassoCheckResult]: Stem: 536#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 537#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 538#L367 assume !(main_~length~0#1 < 1); 530#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 531#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 532#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 539#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 542#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 540#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 541#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 549#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 546#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 533#L370-4 main_~j~0#1 := 0; 534#L378-2 [2024-10-12 00:20:50,397 INFO L747 eck$LassoCheckResult]: Loop: 534#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 543#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 534#L378-2 [2024-10-12 00:20:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2024-10-12 00:20:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859012129] [2024-10-12 00:20:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:50,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:50,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:50,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2024-10-12 00:20:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113972476] [2024-10-12 00:20:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:50,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:50,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:50,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2024-10-12 00:20:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067359692] [2024-10-12 00:20:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067359692] [2024-10-12 00:20:50,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067359692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041768413] [2024-10-12 00:20:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:50,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:50,661 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:50,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 00:20:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:50,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 00:20:50,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:50,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:20:50,766 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-12 00:20:50,766 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 31 treesize of output 11 [2024-10-12 00:20:50,782 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-12 00:20:50,783 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 23 treesize of output 22 [2024-10-12 00:20:50,862 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-12 00:20:50,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-10-12 00:20:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:50,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:50,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 [2024-10-12 00:20:50,987 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 16 [2024-10-12 00:20:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:20:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041768413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:50,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2024-10-12 00:20:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220527117] [2024-10-12 00:20:50,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 00:20:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-10-12 00:20:51,025 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:51,411 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-10-12 00:20:51,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2024-10-12 00:20:51,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:20:51,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2024-10-12 00:20:51,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:20:51,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:20:51,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-10-12 00:20:51,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:51,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-12 00:20:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-10-12 00:20:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2024-10-12 00:20:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 00:20:51,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:20:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:20:51,415 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:20:51,415 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:20:51,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-12 00:20:51,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:51,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:51,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:51,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:51,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:51,416 INFO L745 eck$LassoCheckResult]: Stem: 711#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 712#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 713#L367 assume !(main_~length~0#1 < 1); 704#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 705#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 706#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 714#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 719#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 715#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 716#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 717#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 718#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 707#L370-4 main_~j~0#1 := 0; 708#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 709#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 710#L378-2 [2024-10-12 00:20:51,416 INFO L747 eck$LassoCheckResult]: Loop: 710#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 720#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 710#L378-2 [2024-10-12 00:20:51,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2024-10-12 00:20:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:51,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118962803] [2024-10-12 00:20:51,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:51,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:51,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2024-10-12 00:20:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:51,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943248635] [2024-10-12 00:20:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2024-10-12 00:20:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111915437] [2024-10-12 00:20:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:51,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111915437] [2024-10-12 00:20:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111915437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888879134] [2024-10-12 00:20:51,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:20:51,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:51,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:51,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:51,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-12 00:20:51,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:20:51,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:20:51,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:20:51,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:51,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:20:51,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-10-12 00:20:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:51,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:51,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 14 [2024-10-12 00:20:51,779 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 16 [2024-10-12 00:20:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888879134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:51,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2024-10-12 00:20:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296782278] [2024-10-12 00:20:51,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:51,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 00:20:51,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-12 00:20:51,823 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:51,944 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-10-12 00:20:51,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2024-10-12 00:20:51,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:20:51,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2024-10-12 00:20:51,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-12 00:20:51,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-12 00:20:51,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-10-12 00:20:51,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:51,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-12 00:20:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-10-12 00:20:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2024-10-12 00:20:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-12 00:20:51,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 00:20:51,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:20:51,948 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 00:20:51,948 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:20:51,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2024-10-12 00:20:51,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:51,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:51,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:51,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:51,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:51,949 INFO L745 eck$LassoCheckResult]: Stem: 884#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 885#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 886#L367 assume !(main_~length~0#1 < 1); 878#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 879#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 880#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 887#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 895#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 888#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 889#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 890#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 892#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 893#L370-4 main_~j~0#1 := 0; 898#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 883#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 882#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 891#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 897#L378-2 [2024-10-12 00:20:51,950 INFO L747 eck$LassoCheckResult]: Loop: 897#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 896#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 897#L378-2 [2024-10-12 00:20:51,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:51,950 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2024-10-12 00:20:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401629579] [2024-10-12 00:20:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2024-10-12 00:20:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552282309] [2024-10-12 00:20:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:51,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:51,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2024-10-12 00:20:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101010184] [2024-10-12 00:20:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101010184] [2024-10-12 00:20:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101010184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966864932] [2024-10-12 00:20:52,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:20:52,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:52,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:52,048 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:52,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-12 00:20:52,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 00:20:52,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:20:52,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:20:52,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:52,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966864932] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:52,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:52,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-12 00:20:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280644070] [2024-10-12 00:20:52,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:52,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:20:52,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:20:52,254 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:52,332 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-12 00:20:52,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-10-12 00:20:52,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:52,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2024-10-12 00:20:52,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:20:52,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:20:52,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-10-12 00:20:52,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:52,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-12 00:20:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-10-12 00:20:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-12 00:20:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-12 00:20:52,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-12 00:20:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:20:52,338 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-12 00:20:52,339 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:20:52,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2024-10-12 00:20:52,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:52,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:52,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:52,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:52,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:52,341 INFO L745 eck$LassoCheckResult]: Stem: 1071#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1072#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1073#L367 assume !(main_~length~0#1 < 1); 1064#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1065#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1066#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1074#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1077#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1078#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1088#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1089#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1075#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1076#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1087#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1079#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1080#L370-4 main_~j~0#1 := 0; 1070#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1086#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1085#L378-2 [2024-10-12 00:20:52,341 INFO L747 eck$LassoCheckResult]: Loop: 1085#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1084#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1085#L378-2 [2024-10-12 00:20:52,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2024-10-12 00:20:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921317238] [2024-10-12 00:20:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:52,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:52,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:52,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2024-10-12 00:20:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076752804] [2024-10-12 00:20:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:52,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:52,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:52,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2024-10-12 00:20:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3877110] [2024-10-12 00:20:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:52,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3877110] [2024-10-12 00:20:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3877110] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905999725] [2024-10-12 00:20:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:52,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:52,599 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:52,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-12 00:20:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:52,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 00:20:52,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:52,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-12 00:20:52,708 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-12 00:20:52,708 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 33 treesize of output 13 [2024-10-12 00:20:52,728 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-10-12 00:20:52,728 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 25 treesize of output 24 [2024-10-12 00:20:52,853 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-12 00:20:52,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-10-12 00:20:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:52,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:52,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 14 [2024-10-12 00:20:52,952 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 16 [2024-10-12 00:20:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:20:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905999725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:52,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 18 [2024-10-12 00:20:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407453568] [2024-10-12 00:20:52,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 00:20:52,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 00:20:52,997 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:53,380 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-10-12 00:20:53,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2024-10-12 00:20:53,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:20:53,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2024-10-12 00:20:53,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:20:53,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-12 00:20:53,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2024-10-12 00:20:53,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:53,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-12 00:20:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2024-10-12 00:20:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2024-10-12 00:20:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-10-12 00:20:53,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-12 00:20:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 00:20:53,384 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-12 00:20:53,384 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:20:53,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-10-12 00:20:53,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:53,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:53,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:53,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:53,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:53,386 INFO L745 eck$LassoCheckResult]: Stem: 1282#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1284#L367 assume !(main_~length~0#1 < 1); 1275#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1276#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1277#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1285#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1294#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1286#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1287#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1292#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1293#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1288#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1289#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1291#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1278#L370-4 main_~j~0#1 := 0; 1279#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1280#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1281#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1290#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1296#L378-2 [2024-10-12 00:20:53,386 INFO L747 eck$LassoCheckResult]: Loop: 1296#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1295#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1296#L378-2 [2024-10-12 00:20:53,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2024-10-12 00:20:53,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:53,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719516944] [2024-10-12 00:20:53,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:53,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2024-10-12 00:20:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380011878] [2024-10-12 00:20:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:53,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2024-10-12 00:20:53,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:53,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961130624] [2024-10-12 00:20:53,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961130624] [2024-10-12 00:20:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961130624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141920230] [2024-10-12 00:20:53,570 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:20:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:53,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:53,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-12 00:20:53,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:20:53,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:20:53,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:20:53,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:53,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-12 00:20:53,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2024-10-12 00:20:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:53,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:53,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 14 [2024-10-12 00:20:53,762 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 16 [2024-10-12 00:20:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141920230] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:53,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2024-10-12 00:20:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773250232] [2024-10-12 00:20:53,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:53,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:53,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 00:20:53,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-12 00:20:53,808 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:53,905 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-12 00:20:53,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2024-10-12 00:20:53,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:20:53,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2024-10-12 00:20:53,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-12 00:20:53,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-10-12 00:20:53,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2024-10-12 00:20:53,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:53,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-12 00:20:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2024-10-12 00:20:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-10-12 00:20:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-12 00:20:53,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-12 00:20:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 00:20:53,909 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-12 00:20:53,909 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:20:53,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2024-10-12 00:20:53,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:53,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:53,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:53,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:53,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:53,910 INFO L745 eck$LassoCheckResult]: Stem: 1489#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1491#L367 assume !(main_~length~0#1 < 1); 1483#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1484#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1485#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1492#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1500#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1501#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1502#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1503#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1493#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1494#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1496#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1497#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1498#L370-4 main_~j~0#1 := 0; 1508#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1486#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1487#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1495#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1507#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1506#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1505#L378-2 [2024-10-12 00:20:53,911 INFO L747 eck$LassoCheckResult]: Loop: 1505#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1504#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1505#L378-2 [2024-10-12 00:20:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025749, now seen corresponding path program 5 times [2024-10-12 00:20:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335767286] [2024-10-12 00:20:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:53,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2024-10-12 00:20:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:53,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9150384] [2024-10-12 00:20:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:53,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:53,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:53,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1267385006, now seen corresponding path program 5 times [2024-10-12 00:20:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:53,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135901158] [2024-10-12 00:20:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135901158] [2024-10-12 00:20:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135901158] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282057143] [2024-10-12 00:20:54,020 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:20:54,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:54,022 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:54,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-12 00:20:54,076 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-12 00:20:54,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:20:54,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:20:54,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:54,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282057143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:54,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:54,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-12 00:20:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955641709] [2024-10-12 00:20:54,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 00:20:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 00:20:54,236 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:20:54,292 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-12 00:20:54,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-10-12 00:20:54,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:54,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 43 transitions. [2024-10-12 00:20:54,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:20:54,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:20:54,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2024-10-12 00:20:54,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:20:54,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-12 00:20:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2024-10-12 00:20:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-12 00:20:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:20:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-10-12 00:20:54,294 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-12 00:20:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:20:54,295 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-12 00:20:54,295 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:20:54,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2024-10-12 00:20:54,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:20:54,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:54,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:54,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:20:54,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:20:54,296 INFO L745 eck$LassoCheckResult]: Stem: 1720#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1722#L367 assume !(main_~length~0#1 < 1); 1714#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1715#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1716#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1723#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1744#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1724#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1725#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1726#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1728#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1743#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1742#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1741#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1739#L372 assume main_#t~mem208#1 > 0;havoc main_#t~mem208#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1731#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1729#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1717#L370-4 main_~j~0#1 := 0; 1718#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1727#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1735#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1734#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1733#L378-2 [2024-10-12 00:20:54,296 INFO L747 eck$LassoCheckResult]: Loop: 1733#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1732#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1733#L378-2 [2024-10-12 00:20:54,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 2 times [2024-10-12 00:20:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:54,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158396654] [2024-10-12 00:20:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:54,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:54,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:54,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2024-10-12 00:20:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:54,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242601499] [2024-10-12 00:20:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:54,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:54,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:54,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 2 times [2024-10-12 00:20:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537875566] [2024-10-12 00:20:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:54,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:20:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537875566] [2024-10-12 00:20:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537875566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:20:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606177649] [2024-10-12 00:20:54,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:20:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:20:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:54,549 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:20:54,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-12 00:20:54,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:20:54,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:20:54,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 00:20:54,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:54,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:20:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:20:54,729 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2024-10-12 00:20:54,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:20:54,739 INFO L378 Elim1Store]: Elim1 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 [2024-10-12 00:20:54,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 00:20:54,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:20:54,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2024-10-12 00:20:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:20:54,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:20:55,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 14 [2024-10-12 00:20:55,015 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 16 [2024-10-12 00:20:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:20:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606177649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:20:55,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:20:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 26 [2024-10-12 00:20:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87778320] [2024-10-12 00:20:55,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:20:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:20:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 00:20:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2024-10-12 00:20:55,060 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:07,391 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-10-12 00:21:07,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2024-10-12 00:21:07,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:21:07,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 58 transitions. [2024-10-12 00:21:07,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-12 00:21:07,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:21:07,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2024-10-12 00:21:07,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:07,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-10-12 00:21:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2024-10-12 00:21:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2024-10-12 00:21:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-12 00:21:07,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-12 00:21:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 00:21:07,394 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-12 00:21:07,395 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:21:07,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2024-10-12 00:21:07,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:07,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:07,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:07,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:07,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:07,396 INFO L745 eck$LassoCheckResult]: Stem: 1992#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1994#L367 assume !(main_~length~0#1 < 1); 1985#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1986#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1987#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1995#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2007#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 1996#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1997#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2001#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2002#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2006#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2005#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2004#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1998#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 1999#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2003#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1990#L370-4 main_~j~0#1 := 0; 1991#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1988#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1989#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2000#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2011#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2010#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2009#L378-2 [2024-10-12 00:21:07,396 INFO L747 eck$LassoCheckResult]: Loop: 2009#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2008#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2009#L378-2 [2024-10-12 00:21:07,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:07,396 INFO L85 PathProgramCache]: Analyzing trace with hash 893969701, now seen corresponding path program 6 times [2024-10-12 00:21:07,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:07,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682862197] [2024-10-12 00:21:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:07,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:07,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:07,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:07,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2024-10-12 00:21:07,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:07,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542657594] [2024-10-12 00:21:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:07,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:07,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:07,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 111424808, now seen corresponding path program 6 times [2024-10-12 00:21:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050051412] [2024-10-12 00:21:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:21:07,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050051412] [2024-10-12 00:21:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050051412] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:21:07,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293875231] [2024-10-12 00:21:07,607 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:21:07,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:21:07,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:07,609 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:21:07,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-12 00:21:07,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-12 00:21:07,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:21:07,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:21:07,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:07,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-12 00:21:07,994 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-12 00:21:07,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2024-10-12 00:21:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:07,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:21:08,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 16 [2024-10-12 00:21:08,332 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 16 [2024-10-12 00:21:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:08,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293875231] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:21:08,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:21:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2024-10-12 00:21:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679969507] [2024-10-12 00:21:08,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:21:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:21:08,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-12 00:21:08,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 00:21:08,430 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 8 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:21:09,230 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-12 00:21:09,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-10-12 00:21:09,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:21:09,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2024-10-12 00:21:09,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:21:09,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-12 00:21:09,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2024-10-12 00:21:09,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:09,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-12 00:21:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2024-10-12 00:21:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2024-10-12 00:21:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-12 00:21:09,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-12 00:21:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 00:21:09,236 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-12 00:21:09,236 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 00:21:09,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-10-12 00:21:09,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:21:09,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:21:09,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:21:09,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:21:09,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:21:09,237 INFO L745 eck$LassoCheckResult]: Stem: 2299#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~mem208#1, main_#t~post209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2301#L367 assume !(main_~length~0#1 < 1); 2293#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2294#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2295#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2302#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2313#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2303#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2304#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2305#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2306#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2312#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2311#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2310#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet207#1;call write~int#0(main_#t~nondet207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet207#1;call main_#t~mem208#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2308#L372 assume !(main_#t~mem208#1 > 0);havoc main_#t~mem208#1; 2309#L370-2 main_#t~post209#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post209#1;havoc main_#t~post209#1; 2307#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2296#L370-4 main_~j~0#1 := 0; 2297#L378-2 [2024-10-12 00:21:09,237 INFO L747 eck$LassoCheckResult]: Loop: 2297#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2298#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2297#L378-2 [2024-10-12 00:21:09,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:09,237 INFO L85 PathProgramCache]: Analyzing trace with hash -49003114, now seen corresponding path program 2 times [2024-10-12 00:21:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:09,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731453656] [2024-10-12 00:21:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:09,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:09,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2024-10-12 00:21:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125460080] [2024-10-12 00:21:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:09,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:09,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:09,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 152649051, now seen corresponding path program 7 times [2024-10-12 00:21:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:21:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138959656] [2024-10-12 00:21:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:21:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:21:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:09,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:21:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:21:09,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:21:09,789 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:21:09,789 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:21:09,789 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:21:09,789 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:21:09,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:21:09,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:09,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:21:09,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:21:09,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration14_Lasso [2024-10-12 00:21:09,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:21:09,793 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:21:09,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:09,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:21:10,082 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:21:10,082 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:21:10,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,085 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:21:10,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:21:10,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,115 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:21:10,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,147 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:21:10,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,179 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:21:10,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,207 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:21:10,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,235 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:21:10,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,262 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:21:10,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,289 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:21:10,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,317 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:21:10,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,343 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:21:10,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:21:10,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:21:10,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:21:10,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,371 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:21:10,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:10,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:10,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:21:10,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,402 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:21:10,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:10,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:10,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,432 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:21:10,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:10,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:10,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:21:10,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,461 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:21:10,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:10,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:10,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,492 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:21:10,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:10,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:10,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:21:10,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,521 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:21:10,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:21:10,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:21:10,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:21:10,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:21:10,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:21:10,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:21:10,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:21:10,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:21:10,556 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:21:10,556 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:21:10,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:21:10,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:21:10,557 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:21:10,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:21:10,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:21:10,569 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:21:10,569 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:21:10,569 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-10-12 00:21:10,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:10,589 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-12 00:21:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:21:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:10,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:21:10,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:21:10,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:21:10,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:21:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:21:10,644 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:21:10,645 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:10,659 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 29 transitions. Complement of second has 4 states. [2024-10-12 00:21:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:21:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:21:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-12 00:21:10,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2024-10-12 00:21:10,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:10,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2024-10-12 00:21:10,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:10,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2024-10-12 00:21:10,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:21:10,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2024-10-12 00:21:10,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:21:10,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2024-10-12 00:21:10,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:21:10,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:21:10,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:21:10,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:21:10,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:21:10,663 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:21:10,663 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:21:10,663 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 00:21:10,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:21:10,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:21:10,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:21:10,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:21:10 BoogieIcfgContainer [2024-10-12 00:21:10,670 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:21:10,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:21:10,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:21:10,671 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:21:10,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:20:47" (3/4) ... [2024-10-12 00:21:10,673 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:21:10,674 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:21:10,674 INFO L158 Benchmark]: Toolchain (without parser) took 23925.17ms. Allocated memory was 163.6MB in the beginning and 272.6MB in the end (delta: 109.1MB). Free memory was 107.8MB in the beginning and 119.0MB in the end (delta: -11.3MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2024-10-12 00:21:10,674 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:21:10,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.73ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 87.1MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 00:21:10,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.92ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 85.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:21:10,676 INFO L158 Benchmark]: Boogie Preprocessor took 36.71ms. Allocated memory is still 163.6MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:21:10,678 INFO L158 Benchmark]: RCFGBuilder took 268.16ms. Allocated memory is still 163.6MB. Free memory was 83.3MB in the beginning and 72.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:21:10,678 INFO L158 Benchmark]: BuchiAutomizer took 23215.13ms. Allocated memory was 163.6MB in the beginning and 272.6MB in the end (delta: 109.1MB). Free memory was 72.1MB in the beginning and 119.0MB in the end (delta: -46.9MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2024-10-12 00:21:10,678 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 272.6MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:21:10,679 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.73ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 87.1MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.92ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 85.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.71ms. Allocated memory is still 163.6MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 268.16ms. Allocated memory is still 163.6MB. Free memory was 83.3MB in the beginning and 72.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 23215.13ms. Allocated memory was 163.6MB in the beginning and 272.6MB in the end (delta: 109.1MB). Free memory was 72.1MB in the beginning and 119.0MB in the end (delta: -46.9MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 272.6MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~arr~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * j) + length) and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.1s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 8.2s. Construction of modules took 1.4s. Büchi inclusion checks took 13.3s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 98 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 459 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1847 IncrementalHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 121 mSDtfsCounter, 1847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp58 div165 bol100 ite100 ukn100 eq146 hnf94 smp71 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:21:10,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:21:10,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:11,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-12 00:21:11,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-12 00:21:11,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:11,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:11,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 00:21:12,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:21:12,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 00:21:12,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 00:21:13,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE