./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:44:38,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:44:38,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-64bit-Kojak_Default.epf [2024-11-08 23:44:38,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:44:38,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:44:39,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:44:39,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:44:39,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:44:39,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:44:39,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:44:39,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:44:39,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:44:39,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:44:39,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:44:39,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:44:39,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:44:39,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:44:39,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:44:39,042 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-08 23:44:39,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:44:39,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:44:39,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:44:39,048 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:44:39,048 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:44:39,049 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:44:39,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:44:39,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:44:39,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:44:39,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:44:39,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:44:39,053 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:44:39,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:44:39,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk 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(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f [2024-11-08 23:44:39,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:44:39,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:44:39,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:44:39,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:44:39,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:44:39,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i Unable to find full path for "g++" [2024-11-08 23:44:41,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:44:41,637 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:44:41,642 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2024-11-08 23:44:41,654 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/data/e6c3047aa/b69eb61e738647daad0bd6d9afcefd46/FLAG1c4c2c418 [2024-11-08 23:44:41,974 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/data/e6c3047aa/b69eb61e738647daad0bd6d9afcefd46 [2024-11-08 23:44:41,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:44:41,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:44:41,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:44:41,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:44:41,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:44:41,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:44:41" (1/1) ... [2024-11-08 23:44:41,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f2b0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:41, skipping insertion in model container [2024-11-08 23:44:41,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:44:41" (1/1) ... [2024-11-08 23:44:42,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:44:42,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:44:42,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:44:42,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:44:42,499 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:44:42,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42 WrapperNode [2024-11-08 23:44:42,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:44:42,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:44:42,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:44:42,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:44:42,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,558 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 140 [2024-11-08 23:44:42,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:44:42,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:44:42,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:44:42,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:44:42,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:44:42,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:44:42,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:44:42,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:44:42,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:44:42" (1/1) ... [2024-11-08 23:44:42,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:44:42,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:44:42,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:44:42,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:44:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 23:44:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 23:44:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 23:44:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:44:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:44:42,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:44:42,828 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:44:42,829 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:44:43,080 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-08 23:44:43,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:44:43,170 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:44:43,170 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:44:43,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:43 BoogieIcfgContainer [2024-11-08 23:44:43,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:44:43,172 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:44:43,172 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:44:43,183 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:44:43,183 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:43" (1/1) ... [2024-11-08 23:44:43,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:44:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 33 states and 38 transitions. [2024-11-08 23:44:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-08 23:44:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 23:44:43,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 36 states and 42 transitions. [2024-11-08 23:44:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-08 23:44:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:44:44,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 35 states and 41 transitions. [2024-11-08 23:44:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-08 23:44:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:44:44,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 39 states and 48 transitions. [2024-11-08 23:44:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-11-08 23:44:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:44:44,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 41 states and 50 transitions. [2024-11-08 23:44:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-11-08 23:44:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:44:45,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 48 states and 60 transitions. [2024-11-08 23:44:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-08 23:44:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:44:46,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:46,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 44 states and 52 transitions. [2024-11-08 23:44:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-08 23:44:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:44:47,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 53 states and 68 transitions. [2024-11-08 23:44:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-11-08 23:44:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:44:49,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 53 states and 67 transitions. [2024-11-08 23:44:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-11-08 23:44:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:44:49,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 59 states and 76 transitions. [2024-11-08 23:44:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-08 23:44:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:44:52,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 64 states and 88 transitions. [2024-11-08 23:44:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-11-08 23:44:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:44:52,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 67 states and 95 transitions. [2024-11-08 23:44:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-11-08 23:44:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:44:53,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:53,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 68 states and 98 transitions. [2024-11-08 23:44:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2024-11-08 23:44:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:44:55,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 70 states and 99 transitions. [2024-11-08 23:44:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2024-11-08 23:44:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:44:56,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:44:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:44:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 72 states and 100 transitions. [2024-11-08 23:44:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-08 23:44:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:44:56,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:44:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:44:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:44:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 77 states and 106 transitions. [2024-11-08 23:45:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-11-08 23:45:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:45:02,260 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:02,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 79 states and 107 transitions. [2024-11-08 23:45:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2024-11-08 23:45:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:45:03,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:03,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 80 states and 111 transitions. [2024-11-08 23:45:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2024-11-08 23:45:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:45:03,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 82 states and 112 transitions. [2024-11-08 23:45:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2024-11-08 23:45:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:45:04,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 84 states and 113 transitions. [2024-11-08 23:45:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2024-11-08 23:45:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:45:05,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-08 23:45:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-08 23:45:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:45:06,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 85 states and 116 transitions. [2024-11-08 23:45:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-11-08 23:45:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:45:07,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 100 states and 145 transitions. [2024-11-08 23:45:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-11-08 23:45:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:45:17,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:17,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 102 states and 149 transitions. [2024-11-08 23:45:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-08 23:45:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:45:18,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 115 states and 175 transitions. [2024-11-08 23:45:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2024-11-08 23:45:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:45:27,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 116 states and 178 transitions. [2024-11-08 23:45:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 178 transitions. [2024-11-08 23:45:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:45:29,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 120 states and 185 transitions. [2024-11-08 23:45:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 185 transitions. [2024-11-08 23:45:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:45:31,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 126 states and 195 transitions. [2024-11-08 23:45:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2024-11-08 23:45:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 23:45:39,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 126 states and 195 transitions. [2024-11-08 23:45:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2024-11-08 23:45:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 23:45:40,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 133 states and 205 transitions. [2024-11-08 23:45:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2024-11-08 23:45:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 23:45:50,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 134 states and 208 transitions. [2024-11-08 23:45:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 208 transitions. [2024-11-08 23:45:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 23:45:51,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 138 states and 214 transitions. [2024-11-08 23:45:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 214 transitions. [2024-11-08 23:45:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 23:45:55,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:45:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:45:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 137 states and 212 transitions. [2024-11-08 23:45:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2024-11-08 23:45:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:45:58,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:45:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:45:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:45:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:46:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 139 states and 216 transitions. [2024-11-08 23:46:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 216 transitions. [2024-11-08 23:46:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:46:01,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:46:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:46:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 146 states and 225 transitions. [2024-11-08 23:46:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2024-11-08 23:46:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:46:08,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:46:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:46:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:46:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 56 states and 76 transitions. [2024-11-08 23:46:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-08 23:46:10,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:46:10,561 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 36 iterations. [2024-11-08 23:46:10,569 INFO L729 CodeCheckObserver]: All specifications hold 10 specifications checked. All of them hold [2024-11-08 23:46:15,962 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:46:15,962 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2024-11-08 23:46:15,963 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:46:15,963 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:46:15,963 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< .cse0 4294967296) (or (< 0 (+ .cse0 1)) (not |ULTIMATE.start_test_fun_#t~short9#1|)) (or |ULTIMATE.start_test_fun_#t~short9#1| (< .cse0 0)) (or |ULTIMATE.start_test_fun_#t~short9#1| (< (+ .cse0 .cse1) 2147483647)) (< 0 (+ 2147483649 .cse0)) (<= 0 (+ .cse1 2147483648)))) [2024-11-08 23:46:15,963 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= |ULTIMATE.start_test_fun_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< 0 (+ .cse0 1)) (< |ULTIMATE.start_test_fun_#t~mem7#1| 4294967296) (<= .cse0 |ULTIMATE.start_test_fun_#t~mem7#1|) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem8#1| 2147483648)))) [2024-11-08 23:46:15,964 INFO L77 FloydHoareUtils]: At program point L557-3(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= |ULTIMATE.start_test_fun_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< 0 (+ .cse0 1)) (<= .cse0 |ULTIMATE.start_test_fun_#t~mem7#1|) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem8#1| 2147483648)))) [2024-11-08 23:46:15,964 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2024-11-08 23:46:15,964 INFO L77 FloydHoareUtils]: At program point L557-5(line 557) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (+ .cse3 1)) (.cse1 (+ .cse3 .cse5)) (.cse4 (not |ULTIMATE.start_test_fun_#t~short9#1|))) (or (and .cse0 (<= .cse1 2147483646) (<= .cse2 0) (< 0 (+ 2147483649 .cse3)) .cse4) (and .cse0 (< 0 .cse2) (or (< .cse1 2147483647) .cse4) (<= 0 (+ .cse5 2147483648)))))) [2024-11-08 23:46:15,964 INFO L77 FloydHoareUtils]: At program point L557-6(line 557) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse3 (+ .cse4 1)) (.cse2 (+ .cse4 .cse5)) (.cse0 (not |ULTIMATE.start_test_fun_#t~short14#1|))) (or (and .cse0 .cse1 (<= .cse2 2147483646) (<= .cse3 0) (< 0 (+ 2147483649 .cse4))) (and .cse1 (< 0 .cse3) (or (< .cse2 2147483647) .cse0) (<= 0 (+ .cse5 2147483648)))))) [2024-11-08 23:46:15,965 INFO L77 FloydHoareUtils]: At program point L557-8(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse1 (+ .cse0 1))) (or (and |ULTIMATE.start_test_fun_#t~short13#1| (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ .cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) 2147483646) (<= .cse1 0) (< 0 (+ 2147483649 .cse0))) (and (< 0 .cse1) (not |ULTIMATE.start_test_fun_#t~short13#1|))))) [2024-11-08 23:46:15,965 INFO L77 FloydHoareUtils]: At program point L557-9(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= (+ |ULTIMATE.start_test_fun_#t~mem11#1| 1) 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem11#1| .cse0) (<= (+ .cse0 |ULTIMATE.start_test_fun_#t~mem12#1|) 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem11#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~mem12#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) [2024-11-08 23:46:15,965 INFO L77 FloydHoareUtils]: At program point L557-10(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= (+ |ULTIMATE.start_test_fun_#t~mem11#1| 1) 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= |ULTIMATE.start_test_fun_#t~mem11#1| .cse0) (<= (+ .cse0 |ULTIMATE.start_test_fun_#t~mem12#1|) 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem11#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~mem12#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)))) [2024-11-08 23:46:15,965 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:46:15,965 INFO L77 FloydHoareUtils]: At program point L557-12(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (<= 0 (+ 2147483649 .cse0))) (.cse1 (not |ULTIMATE.start_test_fun_#t~short13#1|))) (or (and (< 0 (+ .cse0 1)) .cse1) (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (<= 0 (+ .cse2 2147483646)) (<= (+ .cse0 .cse2) 2147483647) .cse3 (< 0 (+ .cse0 .cse2 2147483648)) .cse4)) (and .cse3 .cse4 .cse1)))) [2024-11-08 23:46:15,966 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 23:46:15,966 INFO L77 FloydHoareUtils]: At program point L557-13(line 557) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse8 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse1 (+ .cse9 .cse8))) (let ((.cse0 (<= 0 (+ .cse8 2147483646))) (.cse3 (<= 0 (+ 2147483649 .cse9))) (.cse4 (not |ULTIMATE.start_test_fun_#t~short14#1|)) (.cse5 (+ .cse9 .cse8 2147483648)) (.cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse6 (<= .cse1 2147483646)) (.cse7 (< 0 (+ .cse9 1)))) (or (and .cse0 (<= .cse1 2147483647) .cse2 .cse3 (<= 2147483647 .cse1)) (and .cse4 (< 2147483646 .cse1)) (and (<= 0 .cse5) .cse2 .cse6 (or .cse0 .cse4) .cse3) (and .cse4 .cse7) (and .cse4 (< .cse5 0)) (and .cse2 .cse6 .cse7 (<= 0 (+ .cse8 2147483648))))))) [2024-11-08 23:46:15,967 INFO L77 FloydHoareUtils]: At program point L557-14(line 557) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse9 (+ .cse10 .cse7))) (let ((.cse4 (<= .cse9 2147483646)) (.cse0 (+ .cse10 .cse7 2147483648)) (.cse1 (<= 0 (+ .cse7 2147483646))) (.cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse8 (< 2147483646 .cse9)) (.cse5 (<= 0 (+ 2147483649 .cse10))) (.cse6 (< 0 (+ .cse10 1))) (.cse2 (not |ULTIMATE.start_test_fun_#t~short18#1|))) (or (and (<= 0 .cse0) (or .cse1 .cse2) .cse3 .cse4 .cse5) (and .cse3 .cse4 .cse6 (<= 0 (+ .cse7 2147483648))) (and .cse2 (< .cse0 0)) (and .cse8 .cse2) (and .cse1 (<= .cse9 2147483647) .cse3 .cse8 .cse5) (and .cse6 .cse2))))) [2024-11-08 23:46:15,967 INFO L77 FloydHoareUtils]: At program point L557-15(line 557) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse7 (+ |ULTIMATE.start_test_fun_#t~mem16#1| |ULTIMATE.start_test_fun_#t~mem15#1|)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse5 (<= 0 (+ .cse3 2147483646))) (.cse0 (<= .cse7 2147483646)) (.cse1 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse6 (<= 0 (+ 2147483649 .cse8))) (.cse2 (+ .cse8 1)) (.cse4 (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem16#1| |ULTIMATE.start_test_fun_#t~mem15#1| 2147483648)))) (or (and .cse0 .cse1 (< 0 .cse2) (<= .cse3 2147483646) (<= 0 (+ .cse3 2147483648)) .cse4) (and .cse5 .cse1 .cse6 (<= .cse7 2147483647) (< 2147483646 .cse7)) (and .cse5 .cse0 .cse1 .cse6 (<= .cse2 0) .cse4)))) [2024-11-08 23:46:15,968 INFO L77 FloydHoareUtils]: At program point L557-16(line 557) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_test_fun_#t~mem16#1| |ULTIMATE.start_test_fun_#t~mem15#1|)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (<= 0 (+ .cse6 2147483646))) (.cse3 (<= 0 (+ 2147483649 .cse7))) (.cse1 (<= .cse5 2147483646)) (.cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (+ .cse7 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse2 .cse3 (<= .cse5 2147483647) (< 2147483646 .cse5)) (and .cse1 .cse2 (< 0 .cse4) (<= .cse6 2147483646) (<= 0 (+ .cse6 2147483648)))))) [2024-11-08 23:46:15,968 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:46:15,968 INFO L77 FloydHoareUtils]: At program point L557-18(line 557) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (or (not |ULTIMATE.start_test_fun_#t~short18#1|) (and (<= 0 (+ .cse0 2147483646)) .cse1 (<= 0 (+ 2147483649 .cse2))) (and .cse1 (< 0 (+ .cse2 1)) (<= 0 (+ .cse0 2147483648))))) [2024-11-08 23:46:15,968 INFO L77 FloydHoareUtils]: At program point L557-24(lines 557 560) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse1 (+ .cse4 1)) (.cse2 (<= .cse3 2147483646))) (or (and .cse0 (< 0 .cse1) .cse2 (<= 0 (+ .cse3 2147483648)) (< .cse4 2147483647)) (and (<= 0 (+ .cse3 2147483646)) .cse0 (<= 0 (+ 2147483649 .cse4)) (<= .cse1 0) .cse2) (not |ULTIMATE.start_test_fun_#t~short22#1|)))) [2024-11-08 23:46:15,969 INFO L77 FloydHoareUtils]: At program point L557-26(lines 557 560) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (<= .cse0 2147483647) (< .cse1 2147483648) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (< 0 (+ 2147483649 .cse1)) (<= 0 (+ .cse0 2147483648)))) [2024-11-08 23:46:15,969 INFO L77 FloydHoareUtils]: At program point L557-27(lines 557 560) the Hoare annotation is: true [2024-11-08 23:46:15,969 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse1 (<= .cse2 2147483646))) (or (and (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483646) (<= 0 |ULTIMATE.start_test_fun_#t~mem23#1|) .cse0 .cse1 (<= 0 (+ .cse2 2147483648))) (and (<= 0 (+ .cse2 2147483646)) .cse0 (<= 0 (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem23#1|)) .cse1 (< |ULTIMATE.start_test_fun_#t~mem23#1| 0))))) [2024-11-08 23:46:15,969 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (<= |ULTIMATE.start_test_fun_#t~mem23#1| 2147483646) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem23#1|)) (<= .cse0 2147483646) (<= 0 (+ .cse0 2147483648)))) [2024-11-08 23:46:15,969 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2024-11-08 23:46:15,969 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 23:46:15,970 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2024-11-08 23:46:15,970 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= |ULTIMATE.start_test_fun_#t~mem24#1| 2147483646) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse0 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_#t~mem24#1| 2147483648)) (<= 0 (+ .cse0 2147483648)))) [2024-11-08 23:46:15,970 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= |ULTIMATE.start_test_fun_#t~mem24#1| 2147483646) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse0 2147483647) (<= 0 (+ .cse0 2147483648)) (<= 0 (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem24#1|)))) [2024-11-08 23:46:15,970 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2024-11-08 23:46:15,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:46:15 ImpRootNode [2024-11-08 23:46:15,983 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:46:15,983 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:46:15,983 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:46:15,983 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:46:15,984 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:44:43" (3/4) ... [2024-11-08 23:46:15,986 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:46:15,992 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-08 23:46:15,992 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 23:46:15,993 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 23:46:15,993 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:46:16,086 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:46:16,087 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 23:46:16,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:46:16,088 INFO L158 Benchmark]: Toolchain (without parser) took 94109.56ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 129.7MB in the beginning and 562.0MB in the end (delta: -432.3MB). Peak memory consumption was 289.9MB. Max. memory is 16.1GB. [2024-11-08 23:46:16,088 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 123.7MB. Free memory was 86.1MB in the beginning and 86.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:46:16,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.70ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 110.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:46:16,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.06ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:46:16,089 INFO L158 Benchmark]: Boogie Preprocessor took 39.48ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:46:16,089 INFO L158 Benchmark]: RCFGBuilder took 568.32ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 87.0MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 23:46:16,090 INFO L158 Benchmark]: CodeCheck took 92810.80ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 87.0MB in the beginning and 567.2MB in the end (delta: -480.2MB). Peak memory consumption was 243.8MB. Max. memory is 16.1GB. [2024-11-08 23:46:16,090 INFO L158 Benchmark]: Witness Printer took 104.01ms. Allocated memory is still 889.2MB. Free memory was 567.2MB in the beginning and 562.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:46:16,092 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 33 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 87.4s, OverallIterations: 36, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3870 SdHoareTripleChecker+Valid, 25.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2900 mSDsluCounter, 1869 SdHoareTripleChecker+Invalid, 21.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 969 mSDsCounter, 4139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14414 IncrementalHoareTripleChecker+Invalid, 18553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4139 mSolverCounterUnsat, 900 mSDtfsCounter, 14414 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4531 GetRequests, 3794 SyntacticMatches, 145 SemanticMatches, 592 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164526 ImplicationChecksByTransitivity, 80.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 3517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 34 PerfectInterpolantSequences, 13/16 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 123.7MB. Free memory was 86.1MB in the beginning and 86.1MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.70ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 110.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.06ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.48ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 568.32ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 87.0MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * CodeCheck took 92810.80ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 87.0MB in the beginning and 567.2MB in the end (delta: -480.2MB). Peak memory consumption was 243.8MB. Max. memory is 16.1GB. * Witness Printer took 104.01ms. Allocated memory is still 889.2MB. Free memory was 567.2MB in the beginning and 562.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 23:46:16,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b69fd25-9e58-41ae-a7f1-df2dc08570ef/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE