./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-007.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-007.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm --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 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:23:54,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:23:54,686 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:23:54,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:23:54,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:23:54,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:23:54,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:23:54,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:23:54,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:23:54,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:23:54,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:23:54,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:23:54,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:23:54,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:23:54,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:23:54,747 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:23:54,748 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:23:54,748 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:23:54,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:23:54,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:23:54,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:23:54,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:23:54,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:23:54,750 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:23:54,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:23:54,750 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_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm 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 -> 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 [2024-11-13 22:23:55,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:23:55,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:23:55,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:23:55,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:23:55,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:23:55,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/xcsp/AllInterval-007.c Unable to find full path for "g++" [2024-11-13 22:23:57,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:23:57,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:23:57,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/sv-benchmarks/c/xcsp/AllInterval-007.c [2024-11-13 22:23:57,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/data/7bc9662de/06db691f5b5d42d3bac83acfacb7175d/FLAG936186d7a [2024-11-13 22:23:57,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/data/7bc9662de/06db691f5b5d42d3bac83acfacb7175d [2024-11-13 22:23:57,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:23:57,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:23:57,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:23:57,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:23:57,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:23:57,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:23:57" (1/1) ... [2024-11-13 22:23:57,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a71d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:57, skipping insertion in model container [2024-11-13 22:23:57,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:23:57" (1/1) ... [2024-11-13 22:23:57,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:23:58,138 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_2c5119d8-2e69-4bcc-9486-e5b7166381a3/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2024-11-13 22:23:58,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:23:58,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:23:58,224 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_2c5119d8-2e69-4bcc-9486-e5b7166381a3/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2024-11-13 22:23:58,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:23:58,253 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:23:58,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58 WrapperNode [2024-11-13 22:23:58,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:23:58,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:23:58,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:23:58,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:23:58,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,313 INFO L138 Inliner]: procedures = 13, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 162 [2024-11-13 22:23:58,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:23:58,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:23:58,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:23:58,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:23:58,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:23:58,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:23:58,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:23:58,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:23:58,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:23:58" (1/1) ... [2024-11-13 22:23:58,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:23:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:23:58,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:23:58,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:23:58,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:23:58,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:23:58,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:23:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:23:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-13 22:23:58,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-13 22:23:58,545 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:23:58,549 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:23:58,965 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 22:23:58,966 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:23:59,011 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:23:59,013 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 22:23:59,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:23:59 BoogieIcfgContainer [2024-11-13 22:23:59,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:23:59,015 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:23:59,015 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:23:59,029 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:23:59,029 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:23:59" (1/1) ... [2024-11-13 22:23:59,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:23:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:23:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 93 states and 159 transitions. [2024-11-13 22:23:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 159 transitions. [2024-11-13 22:23:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-13 22:23:59,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:23:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:24:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:24:00,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:24:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:24:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:24:02,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 22:24:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 22:24:02,472 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. [2024-11-13 22:24:02,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:24:02 ImpRootNode [2024-11-13 22:24:02,630 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:24:02,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:24:02,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:24:02,631 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:24:02,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:23:59" (3/4) ... [2024-11-13 22:24:02,635 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 22:24:02,785 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:24:02,786 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:24:02,789 INFO L158 Benchmark]: Toolchain (without parser) took 4932.51ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 38.6MB in the end (delta: 54.8MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2024-11-13 22:24:02,790 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:24:02,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.17ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 80.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:24:02,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.55ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:24:02,791 INFO L158 Benchmark]: Boogie Preprocessor took 23.63ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.4MB in the end (delta: 953.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:24:02,791 INFO L158 Benchmark]: RCFGBuilder took 675.94ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 60.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:24:02,792 INFO L158 Benchmark]: CodeCheck took 3614.67ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 48.4MB in the end (delta: 11.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-13 22:24:02,792 INFO L158 Benchmark]: Witness Printer took 155.84ms. Allocated memory is still 117.4MB. Free memory was 48.4MB in the beginning and 38.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:24:02,795 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 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 - CounterExampleResult [Line: 135]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L29] RET assume(var0 >= 0) VAL [var0=4] [L30] CALL assume(var0 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L30] RET assume(var0 <= 6) VAL [var0=4] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L33] RET assume(var1 >= 0) VAL [var0=4, var1=0] [L34] CALL assume(var1 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L34] RET assume(var1 <= 6) VAL [var0=4, var1=0] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L37] RET assume(var2 >= 0) VAL [var0=4, var1=0, var2=6] [L38] CALL assume(var2 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L38] RET assume(var2 <= 6) VAL [var0=4, var1=0, var2=6] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L41] RET assume(var3 >= 0) VAL [var0=4, var1=0, var2=6, var3=1] [L42] CALL assume(var3 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L42] RET assume(var3 <= 6) VAL [var0=4, var1=0, var2=6, var3=1] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L45] RET assume(var4 >= 0) VAL [var0=4, var1=0, var2=6, var3=1, var4=2] [L46] CALL assume(var4 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L46] RET assume(var4 <= 6) VAL [var0=4, var1=0, var2=6, var3=1, var4=2] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L49] RET assume(var5 >= 0) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5] [L50] CALL assume(var5 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L50] RET assume(var5 <= 6) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L53] RET assume(var6 >= 0) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3] [L54] CALL assume(var6 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L54] RET assume(var6 <= 6) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L57] RET assume(var7 >= 1) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4] [L58] CALL assume(var7 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L58] RET assume(var7 <= 6) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L61] RET assume(var8 >= 1) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6] [L62] CALL assume(var8 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L62] RET assume(var8 <= 6) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L65] RET assume(var9 >= 1) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L66] CALL assume(var9 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L66] RET assume(var9 <= 6) VAL [var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L69] RET assume(var10 >= 1) VAL [var0=4, var10=1, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L70] CALL assume(var10 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L70] RET assume(var10 <= 6) VAL [var0=4, var10=1, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L73] RET assume(var11 >= 1) VAL [var0=4, var10=1, var11=3, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L74] CALL assume(var11 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L74] RET assume(var11 <= 6) VAL [var0=4, var10=1, var11=3, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L77] RET assume(var12 >= 1) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L78] CALL assume(var12 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L78] RET assume(var12 <= 6) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L79] int myvar0 = 1; VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L80] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L80] RET assume(var0 != var1) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L81] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L81] RET assume(var0 != var2) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L82] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L82] RET assume(var0 != var3) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L83] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L83] RET assume(var0 != var4) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L84] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L84] RET assume(var0 != var5) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L85] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L85] RET assume(var0 != var6) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L86] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L86] RET assume(var1 != var2) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L87] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L87] RET assume(var1 != var3) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L88] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L88] RET assume(var1 != var4) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L89] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L89] RET assume(var1 != var5) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L90] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L90] RET assume(var1 != var6) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L91] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L91] RET assume(var2 != var3) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L92] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L92] RET assume(var2 != var4) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L93] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L93] RET assume(var2 != var5) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L94] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L94] RET assume(var2 != var6) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L95] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L95] RET assume(var3 != var4) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L96] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L96] RET assume(var3 != var5) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L97] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L97] RET assume(var3 != var6) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L98] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L98] RET assume(var4 != var5) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L99] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L99] RET assume(var4 != var6) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L100] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L100] RET assume(var5 != var6) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L101] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L101] RET assume(var7 != var8) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L102] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L102] RET assume(var7 != var9) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L103] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L103] RET assume(var7 != var10) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L104] CALL assume(var7 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L104] RET assume(var7 != var11) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L105] CALL assume(var7 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L105] RET assume(var7 != var12) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L106] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L106] RET assume(var8 != var9) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L107] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L107] RET assume(var8 != var10) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L108] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L108] RET assume(var8 != var11) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L109] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L109] RET assume(var8 != var12) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L110] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L110] RET assume(var9 != var10) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L111] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L111] RET assume(var9 != var11) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L112] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L112] RET assume(var9 != var12) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L113] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L113] RET assume(var10 != var11) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L114] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L114] RET assume(var10 != var12) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L115] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L115] RET assume(var11 != var12) VAL [var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L116] int var_for_abs; [L117] var_for_abs = var0 - var1 [L118] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=4] [L119] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L119] RET assume(var7 == var_for_abs) VAL [var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=4] [L120] var_for_abs = var1 - var2 [L121] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=3, var12=2, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=6] [L122] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L122] RET assume(var8 == var_for_abs) VAL [var10=1, var11=3, var12=2, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=6] [L123] var_for_abs = var2 - var3 [L124] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=3, var12=2, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=5] [L125] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L125] RET assume(var9 == var_for_abs) VAL [var10=1, var11=3, var12=2, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=5] [L126] var_for_abs = var3 - var4 [L127] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=3, var12=2, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=1] [L128] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L128] RET assume(var10 == var_for_abs) VAL [var10=1, var11=3, var12=2, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=1] [L129] var_for_abs = var4 - var5 [L130] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=3, var12=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=3] [L131] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L131] RET assume(var11 == var_for_abs) VAL [var10=1, var11=3, var12=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=3] [L132] var_for_abs = var5 - var6 [L133] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=3, var12=2, var7=4, var8=6, var9=5, var_for_abs=2] [L134] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) [L134] RET assume(var12 == var_for_abs) VAL [var10=1, var11=3, var12=2, var7=4, var8=6, var9=5, var_for_abs=2] [L135] reach_error() VAL [var10=1, var11=3, var12=2, var7=4, var8=6, var9=5, var_for_abs=2] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.17ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 80.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.55ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.63ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.4MB in the end (delta: 953.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 675.94ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 60.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 3614.67ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 48.4MB in the end (delta: 11.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Witness Printer took 155.84ms. Allocated memory is still 117.4MB. Free memory was 48.4MB in the beginning and 38.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 22:24:02,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c5119d8-2e69-4bcc-9486-e5b7166381a3/bin/ukojak-verify-EEHR8qb7sm/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE