./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fecc0272e3d3edda13fe6ca0a651d95cf8d16c414f426c1f8f27e509220a775 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 06:25:33,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 06:25:33,826 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 06:25:33,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 06:25:33,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 06:25:33,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 06:25:33,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 06:25:33,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 06:25:33,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 06:25:33,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 06:25:33,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 06:25:33,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 06:25:33,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 06:25:33,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 06:25:33,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 06:25:33,851 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 06:25:33,851 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 06:25:33,851 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 06:25:33,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 06:25:33,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:25:33,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 06:25:33,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 06:25:33,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 06:25:33,852 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 06:25:33,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 06:25:33,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fecc0272e3d3edda13fe6ca0a651d95cf8d16c414f426c1f8f27e509220a775 [2024-12-06 06:25:34,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 06:25:34,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 06:25:34,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 06:25:34,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 06:25:34,097 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 06:25:34,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c [2024-12-06 06:25:36,769 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/data/524a8353e/5a8a1fc2075f4de492aaf27e71bcf7fd/FLAG23e2e9bb3 [2024-12-06 06:25:36,964 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 06:25:36,965 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c [2024-12-06 06:25:36,979 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/data/524a8353e/5a8a1fc2075f4de492aaf27e71bcf7fd/FLAG23e2e9bb3 [2024-12-06 06:25:36,995 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/data/524a8353e/5a8a1fc2075f4de492aaf27e71bcf7fd [2024-12-06 06:25:36,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 06:25:36,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 06:25:37,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 06:25:37,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 06:25:37,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 06:25:37,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:36" (1/1) ... [2024-12-06 06:25:37,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc2dd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37, skipping insertion in model container [2024-12-06 06:25:37,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:36" (1/1) ... [2024-12-06 06:25:37,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 06:25:37,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c[546,559] [2024-12-06 06:25:37,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:25:37,195 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 06:25:37,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound5.c[546,559] [2024-12-06 06:25:37,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:25:37,231 INFO L204 MainTranslator]: Completed translation [2024-12-06 06:25:37,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37 WrapperNode [2024-12-06 06:25:37,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 06:25:37,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 06:25:37,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 06:25:37,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 06:25:37,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,265 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-12-06 06:25:37,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 06:25:37,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 06:25:37,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 06:25:37,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 06:25:37,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 06:25:37,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 06:25:37,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 06:25:37,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 06:25:37,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:25:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 06:25:37,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 06:25:37,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 06:25:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 06:25:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-06 06:25:37,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-06 06:25:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 06:25:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 06:25:37,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 06:25:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 06:25:37,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 06:25:37,390 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 06:25:37,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 06:25:37,501 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-12-06 06:25:37,502 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 06:25:37,529 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 06:25:37,529 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 06:25:37,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:37 BoogieIcfgContainer [2024-12-06 06:25:37,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 06:25:37,530 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 06:25:37,530 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 06:25:37,541 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 06:25:37,542 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:37" (1/1) ... [2024-12-06 06:25:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 06:25:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 21 states and 27 transitions. [2024-12-06 06:25:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-12-06 06:25:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 06:25:37,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:25:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:37,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-06 06:25:37,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:25:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 06:25:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 24 states and 32 transitions. [2024-12-06 06:25:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-12-06 06:25:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 06:25:37,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:25:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:38,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-06 06:25:38,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:25:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 06:25:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 28 states and 41 transitions. [2024-12-06 06:25:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2024-12-06 06:25:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 06:25:38,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:38,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 06:25:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 28 states and 38 transitions. [2024-12-06 06:25:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-12-06 06:25:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 06:25:39,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:25:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:39,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-06 06:25:39,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:25:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 06:25:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 35 states and 55 transitions. [2024-12-06 06:25:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2024-12-06 06:25:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 06:25:40,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:25:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:40,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-06 06:25:40,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:25:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 06:25:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 41 states and 68 transitions. [2024-12-06 06:25:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 68 transitions. [2024-12-06 06:25:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 06:25:45,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:25:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:45,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-06 06:25:45,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:25:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 06:25:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 41 states and 68 transitions. [2024-12-06 06:25:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 68 transitions. [2024-12-06 06:25:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 06:25:46,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:25:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-06 06:25:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:25:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 06:26:09,426 WARN L286 SmtUtils]: Spent 20.07s on a formula simplification. DAG size of input: 32 DAG size of output: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 06:26:26,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 06:26:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 74 transitions. [2024-12-06 06:26:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2024-12-06 06:26:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:26:26,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:26:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:26,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-06 06:26:26,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:26:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 06:26:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 74 transitions. [2024-12-06 06:26:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2024-12-06 06:26:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:26:27,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:26:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:27,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-06 06:26:27,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:26:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 06:26:55,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 1 |c_ULTIMATE.start_main_~z~0#1|))) (and (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (= |c_ULTIMATE.start_main_~x~0#1| (+ (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) |c_ULTIMATE.start_main_~z~0#1| 1)) (not (= |c_ULTIMATE.start_main_~x~0#1| 1)) .cse0 (not (and .cse0 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse1 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse1)) (= (+ .cse1 1) |c_ULTIMATE.start_main_~x~0#1|)))))))) is different from false [2024-12-06 06:27:05,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| 1)))) .cse2 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse2 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse3 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse3)) (= (+ .cse3 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1)))) is different from false [2024-12-06 06:28:10,410 WARN L286 SmtUtils]: Spent 32.64s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 06:28:16,941 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| 1)))) .cse2 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse2 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse3 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse3)) (= (+ .cse3 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1))))) is different from true [2024-12-06 06:28:42,736 WARN L286 SmtUtils]: Spent 23.94s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 06:28:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:28:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 44 states and 79 transitions. [2024-12-06 06:28:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2024-12-06 06:28:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:28:42,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:28:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:28:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:28:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:28:42,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-06 06:28:42,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:28:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 06:28:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:28:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 45 states and 83 transitions. [2024-12-06 06:28:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2024-12-06 06:28:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:28:43,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:28:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:28:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:28:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:28:43,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-06 06:28:43,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:28:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 06:28:52,206 WARN L286 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 06:29:04,827 WARN L286 SmtUtils]: Spent 12.31s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 06:29:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:29:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 46 states and 85 transitions. [2024-12-06 06:29:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2024-12-06 06:29:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:29:04,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:29:04,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:29:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:29:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:29:04,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-06 06:29:04,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:29:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 06:29:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:29:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 46 states and 85 transitions. [2024-12-06 06:29:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2024-12-06 06:29:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:29:05,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:29:05,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:29:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:29:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:29:05,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-12-06 06:29:05,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:29:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 06:29:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:29:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 46 states and 85 transitions. [2024-12-06 06:29:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2024-12-06 06:29:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:29:06,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:29:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:29:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:29:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:29:06,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-06 06:29:06,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:29:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 06:29:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:29:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 46 states and 85 transitions. [2024-12-06 06:29:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2024-12-06 06:29:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:29:06,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:29:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:29:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:29:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:29:06,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-12-06 06:29:06,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:29:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 06:29:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:29:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 46 states and 85 transitions. [2024-12-06 06:29:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2024-12-06 06:29:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:29:06,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:29:06,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:29:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:29:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:29:06,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-06 06:29:06,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:29:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 06:29:18,199 WARN L286 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 32 DAG size of output: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 06:29:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:29:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 53 states and 105 transitions. [2024-12-06 06:29:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 105 transitions. [2024-12-06 06:29:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:29:18,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:29:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:29:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:29:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:29:18,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-12-06 06:29:18,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:31:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 3 refuted. 4 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 06:33:16,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| 1)))) (exists ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (let ((.cse2 (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse0) (+ .cse2 |c_ULTIMATE.start_main_~y~0#1|)) (= (+ .cse2 .cse1 |c_ULTIMATE.start_main_~z~0#1| 1) |c_ULTIMATE.start_main_~x~0#1|)))) .cse3 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse3 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse4 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse4)) (= (+ .cse4 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1)))) is different from false [2024-12-06 06:34:30,993 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse3 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| 1)))) (exists ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (let ((.cse2 (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse0) (+ .cse2 |c_ULTIMATE.start_main_~y~0#1|)) (= (+ .cse2 .cse1 |c_ULTIMATE.start_main_~z~0#1| 1) |c_ULTIMATE.start_main_~x~0#1|)))) .cse3 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse3 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse4 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse4)) (= (+ .cse4 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1))))) is different from true [2024-12-06 06:34:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:34:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 53 states and 105 transitions. [2024-12-06 06:34:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 105 transitions. [2024-12-06 06:34:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:34:31,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:34:31,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:34:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:34:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:34:31,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-06 06:34:31,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:34:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 06:34:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:34:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 53 states and 105 transitions. [2024-12-06 06:34:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 105 transitions. [2024-12-06 06:34:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:34:31,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:34:31,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:34:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:34:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:34:31,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-06 06:34:31,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:34:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 06:34:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:34:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 53 states and 105 transitions. [2024-12-06 06:34:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 105 transitions. [2024-12-06 06:34:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:34:31,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:34:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:34:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:34:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:34:31,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-06 06:34:31,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:34:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 06:34:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:34:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 53 states and 105 transitions. [2024-12-06 06:34:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 105 transitions. [2024-12-06 06:34:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 06:34:31,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:34:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:34:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 06:34:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:34:31,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-06 06:34:31,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 06:35:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 06:35:47,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse5 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (exists ((|v_ULTIMATE.start_main_~x~0#1_65| Int)) (let ((.cse2 (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| .cse2 1)) (<= .cse3 |v_ULTIMATE.start_main_~x~0#1_65|) (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse2) (+ (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse1))))) (<= |c_ULTIMATE.start_main_~z~0#1| 5) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| .cse3))) (exists ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (let ((.cse4 (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse0) (+ .cse4 |c_ULTIMATE.start_main_~y~0#1|)) (= (+ .cse4 .cse1 |c_ULTIMATE.start_main_~z~0#1| 1) |c_ULTIMATE.start_main_~x~0#1|)))) .cse5 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse5 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= (+ .cse6 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1)))) is different from false [2024-12-06 06:36:54,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse4 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (not (and (exists ((|v_ULTIMATE.start_main_~x~0#1_65| Int)) (let ((.cse2 (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| .cse2 1)) (<= .cse3 |v_ULTIMATE.start_main_~x~0#1_65|) (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse2) (+ (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse1))))) (<= |c_ULTIMATE.start_main_~z~0#1| 5) .cse4)) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| .cse3))) (exists ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse0) (+ .cse5 |c_ULTIMATE.start_main_~y~0#1|)) (= (+ .cse5 .cse1 |c_ULTIMATE.start_main_~z~0#1| 1) |c_ULTIMATE.start_main_~x~0#1|)))) .cse4 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse4 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= (+ .cse6 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1)))) is different from false [2024-12-06 06:37:04,145 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse3 (+ |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse5 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (exists ((|v_ULTIMATE.start_main_~x~0#1_65| Int)) (let ((.cse2 (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| .cse2 1)) (<= .cse3 |v_ULTIMATE.start_main_~x~0#1_65|) (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse2) (+ (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse1))))) (<= |c_ULTIMATE.start_main_~z~0#1| 5) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| .cse3))) (exists ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (let ((.cse4 (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse0) (+ .cse4 |c_ULTIMATE.start_main_~y~0#1|)) (= (+ .cse4 .cse1 |c_ULTIMATE.start_main_~z~0#1| 1) |c_ULTIMATE.start_main_~x~0#1|)))) .cse5 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse5 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= (+ .cse6 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1))))) is different from true [2024-12-06 06:37:14,176 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse3 (+ |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse4 (<= 1 |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (not (and (= |c_ULTIMATE.start_main_~x~0#1| 1) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| 1)))) (not (and (exists ((|v_ULTIMATE.start_main_~x~0#1_65| Int)) (let ((.cse2 (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~z~0#1| .cse2 1)) (<= .cse3 |v_ULTIMATE.start_main_~x~0#1_65|) (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse2) (+ (* |v_ULTIMATE.start_main_~x~0#1_65| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse1))))) (<= |c_ULTIMATE.start_main_~z~0#1| 5) .cse4)) (not (and (= |c_ULTIMATE.start_main_~y~0#1| .cse1) (= |c_ULTIMATE.start_main_~x~0#1| .cse3))) (exists ((|v_ULTIMATE.start_main_~x~0#1_52| Int)) (let ((.cse5 (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ (* |v_ULTIMATE.start_main_~x~0#1_52| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse0) (+ .cse5 |c_ULTIMATE.start_main_~y~0#1|)) (= (+ .cse5 .cse1 |c_ULTIMATE.start_main_~z~0#1| 1) |c_ULTIMATE.start_main_~x~0#1|)))) .cse4 (= |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (not (and .cse4 (exists ((|v_ULTIMATE.start_main_~x~0#1_22| Int)) (let ((.cse6 (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ |c_ULTIMATE.start_main_~z~0#1| (* |v_ULTIMATE.start_main_~x~0#1_22| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= (+ .cse6 1) |c_ULTIMATE.start_main_~x~0#1|)))))) (= |c_ULTIMATE.start_main_~x~0#1| (+ .cse1 |c_ULTIMATE.start_main_~z~0#1| .cse0 1))))) is different from true [2024-12-06 06:37:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:37:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 27 states and 42 transitions. [2024-12-06 06:37:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2024-12-06 06:37:14,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 06:37:14,182 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 22 iterations. [2024-12-06 06:37:14,189 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 06:37:14,627 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 06:37:14,627 INFO L77 FloydHoareUtils]: At program point L29(line 29) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~z~0#1|) [2024-12-06 06:37:14,627 INFO L77 FloydHoareUtils]: At program point L50(line 50) the Hoare annotation is: true [2024-12-06 06:37:14,627 INFO L77 FloydHoareUtils]: At program point L50-1(line 50) the Hoare annotation is: true [2024-12-06 06:37:14,627 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 06:37:14,627 INFO L77 FloydHoareUtils]: At program point L36-2(lines 36 46) the Hoare annotation is: true [2024-12-06 06:37:14,627 INFO L77 FloydHoareUtils]: At program point L36-3(lines 36 46) the Hoare annotation is: true [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L30(line 30) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~k~0#1|) [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L28(line 28) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~z~0#1| 5) (<= 0 |ULTIMATE.start_main_~z~0#1|)) [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L28-1(line 28) the Hoare annotation is: true [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L26(line 26) the Hoare annotation is: true [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L26-1(line 26) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~z~0#1| 5) (<= 0 |ULTIMATE.start_main_~z~0#1|)) [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L37(lines 36 46) the Hoare annotation is: true [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 12 14) the Hoare annotation is: true [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: (not (= |assume_abort_if_not_#in~cond| 0)) [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L17(lines 17 18) the Hoare annotation is: true [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L16(lines 16 19) the Hoare annotation is: (or (and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (<= 1 __VERIFIER_assert_~cond)) (= __VERIFIER_assert_~cond 0)) [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point L16-2(lines 15 21) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~cond| 0)) [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point __VERIFIER_assertEXIT(lines 15 21) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~cond| 0)) [2024-12-06 06:37:14,628 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 15 21) the Hoare annotation is: (not (and (not (= |__VERIFIER_assert_#in~cond| 0)) (< |__VERIFIER_assert_#in~cond| 1))) [2024-12-06 06:37:14,629 INFO L77 FloydHoareUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: true [2024-12-06 06:37:14,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 06:37:14 ImpRootNode [2024-12-06 06:37:14,641 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 06:37:14,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 06:37:14,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 06:37:14,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 06:37:14,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:37" (3/4) ... [2024-12-06 06:37:14,645 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 06:37:14,647 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-12-06 06:37:14,647 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-12-06 06:37:14,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-12-06 06:37:14,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 06:37:14,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-06 06:37:14,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 06:37:14,706 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 06:37:14,706 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 06:37:14,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 06:37:14,707 INFO L158 Benchmark]: Toolchain (without parser) took 697708.90ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 66.8MB in the end (delta: 52.3MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2024-12-06 06:37:14,708 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:37:14,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.80ms. Allocated memory is still 142.6MB. Free memory was 118.9MB in the beginning and 107.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 06:37:14,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.51ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:37:14,709 INFO L158 Benchmark]: Boogie Preprocessor took 19.31ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 106.0MB in the end (delta: 711.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:37:14,709 INFO L158 Benchmark]: RCFGBuilder took 243.27ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 94.7MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 06:37:14,709 INFO L158 Benchmark]: CodeCheck took 697110.75ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 72.0MB in the end (delta: 22.6MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-12-06 06:37:14,710 INFO L158 Benchmark]: Witness Printer took 64.93ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 66.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 06:37:14,711 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 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 696.6s, OverallIterations: 22, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 1300 SdHoareTripleChecker+Valid, 161.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 159.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 345 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 1467 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3711 IncrementalHoareTripleChecker+Invalid, 5538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1467 mSolverCounterUnsat, 473 mSDtfsCounter, 3711 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6179 GetRequests, 5835 SyntacticMatches, 164 SemanticMatches, 180 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 16517 ImplicationChecksByTransitivity, 682.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 250.0s InterpolantComputationTime, 712 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 691 ConstructedInterpolants, 12 QuantifiedInterpolants, 3002 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2096 ConjunctsInSsa, 577 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 521/683 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, ConComCheckerStatistics: No data available - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: ((0 < cond) || (cond == 0)) Ensures: (cond != 0) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.80ms. Allocated memory is still 142.6MB. Free memory was 118.9MB in the beginning and 107.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.51ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.31ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 106.0MB in the end (delta: 711.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 243.27ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 94.7MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 697110.75ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 72.0MB in the end (delta: 22.6MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Witness Printer took 64.93ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 66.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 06:37:14,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27c70d9-3312-4080-ab7c-57aa5dfebfe0/bin/ukojak-verify-CZk0znPC7b/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