./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.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_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/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_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/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_dbb53687-19a6-4464-a14f-91430686c161/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 dc5c360927b8f961c81c15f32a759fd4b0c6971bec3efffa8564070a88946c3e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:48:39,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:48:39,642 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:48:39,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:48:39,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:48:39,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:48:39,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:48:39,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:48:39,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:48:39,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:48:39,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:48:39,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:48:39,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:48:39,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:48:39,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:48:39,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:48:39,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:48:39,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:48:39,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:48:39,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:48:39,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:48:39,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:48:39,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:48:39,696 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:48:39,696 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:48:39,696 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:48:39,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:48:39,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:48:39,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:48:39,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:48:39,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:48:39,697 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:48:39,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:48:39,697 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_dbb53687-19a6-4464-a14f-91430686c161/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 -> dc5c360927b8f961c81c15f32a759fd4b0c6971bec3efffa8564070a88946c3e [2024-11-13 20:48:39,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:48:40,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:48:40,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:48:40,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:48:40,012 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:48:40,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 20:48:41,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:48:42,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:48:42,326 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-11-13 20:48:42,343 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/data/f8c506c16/8bc2b2a462964309b8f590f4d079d44a/FLAG9eb062dac [2024-11-13 20:48:42,364 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/data/f8c506c16/8bc2b2a462964309b8f590f4d079d44a [2024-11-13 20:48:42,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:48:42,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:48:42,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:48:42,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:48:42,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:48:42,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69abf866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42, skipping insertion in model container [2024-11-13 20:48:42,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:48:42,709 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_dbb53687-19a6-4464-a14f-91430686c161/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c[12914,12927] [2024-11-13 20:48:42,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:48:42,723 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:48:42,774 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_dbb53687-19a6-4464-a14f-91430686c161/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c[12914,12927] [2024-11-13 20:48:42,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:48:42,789 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:48:42,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42 WrapperNode [2024-11-13 20:48:42,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:48:42,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:48:42,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:48:42,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:48:42,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,853 INFO L138 Inliner]: procedures = 22, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-11-13 20:48:42,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:48:42,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:48:42,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:48:42,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:48:42,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:48:42,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:48:42,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:48:42,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:48:42,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:48:42" (1/1) ... [2024-11-13 20:48:42,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:48:42,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:48:42,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:48:42,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:48:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:48:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:48:42,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:48:42,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:48:43,115 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:48:43,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:48:43,951 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-13 20:48:43,952 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:48:44,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:48:44,807 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:48:44,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:48:44 BoogieIcfgContainer [2024-11-13 20:48:44,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:48:44,808 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:48:44,809 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:48:44,819 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:48:44,819 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:48:44" (1/1) ... [2024-11-13 20:48:44,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:48:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 20:48:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 20:48:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:48:44,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-13 20:48:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-13 20:48:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:48:47,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-13 20:48:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-13 20:48:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:48:49,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-13 20:48:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-13 20:48:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:48:51,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-13 20:48:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-13 20:48:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:48:53,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-13 20:48:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-13 20:48:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:48:55,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-13 20:48:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-13 20:48:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:48:57,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-13 20:48:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-13 20:48:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:48:58,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:48:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:48:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-13 20:48:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-13 20:48:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:48:58,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:48:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:48:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:48:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 57 states and 96 transitions. [2024-11-13 20:49:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 96 transitions. [2024-11-13 20:49:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:49:01,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 60 states and 101 transitions. [2024-11-13 20:49:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2024-11-13 20:49:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:49:02,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 76 states and 130 transitions. [2024-11-13 20:49:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2024-11-13 20:49:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:49:09,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:09,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 93 states and 171 transitions. [2024-11-13 20:49:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2024-11-13 20:49:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:49:15,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 94 states and 174 transitions. [2024-11-13 20:49:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 174 transitions. [2024-11-13 20:49:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:49:17,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 108 states and 202 transitions. [2024-11-13 20:49:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 202 transitions. [2024-11-13 20:49:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:49:23,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 120 states and 225 transitions. [2024-11-13 20:49:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 225 transitions. [2024-11-13 20:49:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:49:28,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 122 states and 231 transitions. [2024-11-13 20:49:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 231 transitions. [2024-11-13 20:49:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:49:30,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 136 states and 279 transitions. [2024-11-13 20:49:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 279 transitions. [2024-11-13 20:49:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:49:37,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 139 states and 287 transitions. [2024-11-13 20:49:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 287 transitions. [2024-11-13 20:49:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:49:40,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 140 states and 289 transitions. [2024-11-13 20:49:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 289 transitions. [2024-11-13 20:49:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:49:42,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 143 states and 300 transitions. [2024-11-13 20:49:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 300 transitions. [2024-11-13 20:49:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:49:44,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 144 states and 303 transitions. [2024-11-13 20:49:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 303 transitions. [2024-11-13 20:49:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 20:49:45,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:49:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 145 states and 305 transitions. [2024-11-13 20:49:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 305 transitions. [2024-11-13 20:49:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 20:49:47,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:49:47,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:49:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:49:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:49:47,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:49:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:49:48,101 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 23 iterations. [2024-11-13 20:49:48,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:49:48 ImpRootNode [2024-11-13 20:49:48,209 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:49:48,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:49:48,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:49:48,210 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:49:48,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:48:44" (3/4) ... [2024-11-13 20:49:48,212 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:49:48,336 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:49:48,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:49:48,337 INFO L158 Benchmark]: Toolchain (without parser) took 65967.62ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 94.3MB in the beginning and 562.4MB in the end (delta: -468.1MB). Peak memory consumption was 465.7MB. Max. memory is 16.1GB. [2024-11-13 20:49:48,338 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:49:48,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.71ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 77.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:49:48,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.98ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 74.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:49:48,340 INFO L158 Benchmark]: Boogie Preprocessor took 38.56ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:49:48,341 INFO L158 Benchmark]: RCFGBuilder took 1914.98ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 55.1MB in the end (delta: 17.1MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-11-13 20:49:48,342 INFO L158 Benchmark]: CodeCheck took 63400.99ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 55.1MB in the beginning and 575.0MB in the end (delta: -519.9MB). Peak memory consumption was 422.6MB. Max. memory is 16.1GB. [2024-11-13 20:49:48,342 INFO L158 Benchmark]: Witness Printer took 126.61ms. Allocated memory is still 1.1GB. Free memory was 575.0MB in the beginning and 562.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:49:48,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.3s, OverallIterations: 23, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3063 SdHoareTripleChecker+Valid, 27.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2383 mSDsluCounter, 1018 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 682 mSDsCounter, 1331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8972 IncrementalHoareTripleChecker+Invalid, 10303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1331 mSolverCounterUnsat, 336 mSDtfsCounter, 8972 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3783 GetRequests, 3197 SyntacticMatches, 148 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107486 ImplicationChecksByTransitivity, 36.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 353 ConstructedInterpolants, 0 QuantifiedInterpolants, 2459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 24/74 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: 566]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 ; [L27] char p12_old ; [L28] char p12_new ; [L29] _Bool ep12 ; [L30] port_t p13 ; [L31] char p13_old ; [L32] char p13_new ; [L33] _Bool ep13 ; [L34] port_t p21 ; [L35] char p21_old ; [L36] char p21_new ; [L37] _Bool ep21 ; [L38] port_t p23 ; [L39] char p23_old ; [L40] char p23_new ; [L41] _Bool ep23 ; [L42] port_t p31 ; [L43] char p31_old ; [L44] char p31_new ; [L45] _Bool ep31 ; [L46] port_t p32 ; [L47] char p32_old ; [L48] char p32_new ; [L49] _Bool ep32 ; [L50] char id1 ; [L51] unsigned char r1 ; [L52] char st1 ; [L53] char nl1 ; [L54] char m1 ; [L55] char max1 ; [L56] _Bool mode1 ; [L57] char id2 ; [L58] unsigned char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] char id3 ; [L65] unsigned char r3 ; [L66] char st3 ; [L67] char nl3 ; [L68] char m3 ; [L69] char max3 ; [L70] _Bool mode3 ; [L486] int c1 ; [L487] int i2 ; [L490] c1 = 0 [L491] ep12 = __VERIFIER_nondet_bool() [L492] ep13 = __VERIFIER_nondet_bool() [L493] ep21 = __VERIFIER_nondet_bool() [L494] ep23 = __VERIFIER_nondet_bool() [L495] ep31 = __VERIFIER_nondet_bool() [L496] ep32 = __VERIFIER_nondet_bool() [L497] id1 = __VERIFIER_nondet_char() [L498] r1 = __VERIFIER_nondet_uchar() [L499] st1 = __VERIFIER_nondet_char() [L500] nl1 = __VERIFIER_nondet_char() [L501] m1 = __VERIFIER_nondet_char() [L502] max1 = __VERIFIER_nondet_char() [L503] mode1 = __VERIFIER_nondet_bool() [L504] id2 = __VERIFIER_nondet_char() [L505] r2 = __VERIFIER_nondet_uchar() [L506] st2 = __VERIFIER_nondet_char() [L507] nl2 = __VERIFIER_nondet_char() [L508] m2 = __VERIFIER_nondet_char() [L509] max2 = __VERIFIER_nondet_char() [L510] mode2 = __VERIFIER_nondet_bool() [L511] id3 = __VERIFIER_nondet_char() [L512] r3 = __VERIFIER_nondet_uchar() [L513] st3 = __VERIFIER_nondet_char() [L514] nl3 = __VERIFIER_nondet_char() [L515] m3 = __VERIFIER_nondet_char() [L516] max3 = __VERIFIER_nondet_char() [L517] mode3 = __VERIFIER_nondet_bool() [L518] CALL, EXPR init() [L211] _Bool r121 ; [L212] _Bool r131 ; [L213] _Bool r211 ; [L214] _Bool r231 ; [L215] _Bool r311 ; [L216] _Bool r321 ; [L217] _Bool r122 ; [L218] int tmp ; [L219] _Bool r132 ; [L220] int tmp___0 ; [L221] _Bool r212 ; [L222] int tmp___1 ; [L223] _Bool r232 ; [L224] int tmp___2 ; [L225] _Bool r312 ; [L226] int tmp___3 ; [L227] _Bool r322 ; [L228] int tmp___4 ; [L229] int tmp___5 ; [L232] r121 = ep12 [L233] r131 = ep13 [L234] r211 = ep21 [L235] r231 = ep23 [L236] r311 = ep31 [L237] r321 = ep32 [L238] COND FALSE !(\read(r121)) [L241] COND TRUE \read(r131) [L242] COND TRUE \read(ep32) [L243] tmp = 1 [L250] r122 = (_Bool )tmp [L251] COND TRUE \read(r131) [L252] tmp___0 = 1 [L263] r132 = (_Bool )tmp___0 [L264] COND FALSE !(\read(r211)) [L267] COND TRUE \read(r231) [L268] COND TRUE \read(ep31) [L269] tmp___1 = 1 [L276] r212 = (_Bool )tmp___1 [L277] COND TRUE \read(r231) [L278] tmp___2 = 1 [L289] r232 = (_Bool )tmp___2 [L290] COND TRUE \read(r311) [L291] tmp___3 = 1 [L302] r312 = (_Bool )tmp___3 [L303] COND TRUE \read(r321) [L304] tmp___4 = 1 [L315] r322 = (_Bool )tmp___4 [L316] COND TRUE (int )id1 != (int )id2 [L317] COND TRUE (int )id1 != (int )id3 [L318] COND TRUE (int )id2 != (int )id3 [L319] COND TRUE (int )id1 >= 0 [L320] COND TRUE (int )id2 >= 0 [L321] COND TRUE (int )id3 >= 0 [L322] COND TRUE (int )r1 == 0 [L323] COND TRUE (int )r2 == 0 [L324] COND TRUE (int )r3 == 0 [L325] COND TRUE \read(r122) [L326] COND TRUE \read(r132) [L327] COND TRUE \read(r212) [L328] COND TRUE \read(r232) [L329] COND TRUE \read(r312) [L330] COND TRUE \read(r322) [L331] COND TRUE (int )max1 == (int )id1 [L332] COND TRUE (int )max2 == (int )id2 [L333] COND TRUE (int )max3 == (int )id3 [L334] COND TRUE (int )st1 == 0 [L335] COND TRUE (int )st2 == 0 [L336] COND TRUE (int )st3 == 0 [L337] COND TRUE (int )nl1 == 0 [L338] COND TRUE (int )nl2 == 0 [L339] COND TRUE (int )nl3 == 0 [L340] COND TRUE (int )mode1 == 0 [L341] COND TRUE (int )mode2 == 0 [L342] COND TRUE (int )mode3 == 0 [L343] tmp___5 = 1 [L425] return (tmp___5); [L518] RET, EXPR init() [L518] i2 = init() [L519] COND FALSE !(!i2) [L522] p12_old = nomsg [L523] p12_new = nomsg [L524] p13_old = nomsg [L525] p13_new = nomsg [L526] p21_old = nomsg [L527] p21_new = nomsg [L528] p23_old = nomsg [L529] p23_new = nomsg [L530] p31_old = nomsg [L531] p31_new = nomsg [L532] p32_old = nomsg [L533] p32_new = nomsg [L534] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE 1 [L537] CALL node1() [L76] COND FALSE !(\read(mode1)) [L104] COND TRUE (int )r1 < 2 [L105] COND FALSE !(\read(ep12)) [L108] COND TRUE \read(ep13) [L109] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L112] mode1 = (_Bool)1 [L537] RET node1() [L538] CALL node2() [L122] COND FALSE !(\read(mode2)) [L150] COND TRUE (int )r2 < 2 [L151] COND FALSE !(\read(ep21)) [L154] COND TRUE \read(ep23) [L155] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L158] mode2 = (_Bool)1 [L538] RET node2() [L539] CALL node3() [L168] COND FALSE !(\read(mode3)) [L196] COND TRUE (int )r3 < 2 [L197] COND TRUE \read(ep31) [L198] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L200] COND TRUE \read(ep32) [L201] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L204] mode3 = (_Bool)1 [L539] RET node3() [L540] p12_old = p12_new [L541] p12_new = nomsg [L542] p13_old = p13_new [L543] p13_new = nomsg [L544] p21_old = p21_new [L545] p21_new = nomsg [L546] p23_old = p23_new [L547] p23_new = nomsg [L548] p31_old = p31_new [L549] p31_new = nomsg [L550] p32_old = p32_new [L551] p32_new = nomsg [L552] CALL, EXPR check() [L430] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L433] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L434] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L435] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE (int )r1 < 2 [L453] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L481] return (tmp); [L552] RET, EXPR check() [L552] c1 = check() [L553] CALL assert(c1) [L564] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=-1, m2=127, m3=125, max1=125, max2=126, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L553] RET assert(c1) [L535] COND TRUE 1 [L537] CALL node1() [L76] COND TRUE \read(mode1) [L77] COND FALSE !(r1 == 255) [L80] r1 = r1 + 1 [L81] COND FALSE !(\read(ep21)) [L88] COND TRUE \read(ep31) [L89] m1 = p31_old [L90] p31_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L95] COND TRUE (int )r1 == 1 [L96] COND TRUE (int )max1 == (int )id1 [L97] st1 = (char)1 [L102] mode1 = (_Bool)0 [L537] RET node1() [L538] CALL node2() [L122] COND TRUE \read(mode2) [L123] COND FALSE !(r2 == 255) [L126] r2 = r2 + 1 [L127] COND FALSE !(\read(ep12)) [L134] COND TRUE \read(ep32) [L135] m2 = p32_old [L136] p32_old = nomsg [L137] COND FALSE !((int )m2 > (int )max2) [L141] COND FALSE !((int )r2 == 2) [L148] mode2 = (_Bool)0 [L538] RET node2() [L539] CALL node3() [L168] COND TRUE \read(mode3) [L169] COND FALSE !(r3 == 255) [L172] r3 = r3 + 1 [L173] COND TRUE \read(ep13) [L174] m3 = p13_old [L175] p13_old = nomsg [L176] COND TRUE (int )m3 > (int )max3 [L177] max3 = m3 [L180] COND TRUE \read(ep23) [L181] m3 = p23_old [L182] p23_old = nomsg [L183] COND TRUE (int )m3 > (int )max3 [L184] max3 = m3 [L187] COND FALSE !((int )r3 == 2) [L194] mode3 = (_Bool)0 [L539] RET node3() [L540] p12_old = p12_new [L541] p12_new = nomsg [L542] p13_old = p13_new [L543] p13_new = nomsg [L544] p21_old = p21_new [L545] p21_new = nomsg [L546] p23_old = p23_new [L547] p23_new = nomsg [L548] p31_old = p31_new [L549] p31_new = nomsg [L550] p32_old = p32_new [L551] p32_new = nomsg [L552] CALL, EXPR check() [L430] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L433] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L434] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L435] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L436] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L440] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L467] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0, tmp=0] [L481] return (tmp); [L552] RET, EXPR check() [L552] c1 = check() [L553] CALL assert(c1) [L564] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L566] reach_error() VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=0, m1=0, m2=0, m3=126, max1=125, max2=126, max3=126, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.71ms. Allocated memory is still 117.4MB. Free memory was 94.3MB in the beginning and 77.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.98ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 74.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.56ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1914.98ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 55.1MB in the end (delta: 17.1MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * CodeCheck took 63400.99ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 55.1MB in the beginning and 575.0MB in the end (delta: -519.9MB). Peak memory consumption was 422.6MB. Max. memory is 16.1GB. * Witness Printer took 126.61ms. Allocated memory is still 1.1GB. Free memory was 575.0MB in the beginning and 562.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:49:48,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbb53687-19a6-4464-a14f-91430686c161/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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