./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9 --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 a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 04:14:55,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 04:14:55,722 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 04:14:55,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 04:14:55,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 04:14:55,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 04:14:55,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 04:14:55,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 04:14:55,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 04:14:55,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 04:14:55,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 04:14:55,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 04:14:55,757 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 04:14:55,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 04:14:55,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 04:14:55,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 04:14:55,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 04:14:55,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 04:14:55,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 04:14:55,761 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 04:14:55,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 04:14:55,765 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 04:14:55,765 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 04:14:55,766 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 04:14:55,766 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 04:14:55,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 04:14:55,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 04:14:55,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 04:14:55,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 04:14:55,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 04:14:55,769 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 04:14:55,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 04:14:55,770 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 04:14:55,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9 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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 [2023-12-03 04:14:55,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 04:14:56,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 04:14:56,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 04:14:56,019 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 04:14:56,020 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 04:14:56,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2023-12-03 04:14:58,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 04:14:59,151 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 04:14:59,152 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2023-12-03 04:14:59,167 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/data/04829df6e/c4dae92c7b88447fb03d941af93227c1/FLAG2eac322bb [2023-12-03 04:14:59,185 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/data/04829df6e/c4dae92c7b88447fb03d941af93227c1 [2023-12-03 04:14:59,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 04:14:59,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 04:14:59,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 04:14:59,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 04:14:59,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 04:14:59,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d59baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59, skipping insertion in model container [2023-12-03 04:14:59,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,250 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 04:14:59,475 WARN L240 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_a068f284-d565-4fb3-8add-af9c56345dae/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2023-12-03 04:14:59,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 04:14:59,493 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 04:14:59,552 WARN L240 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_a068f284-d565-4fb3-8add-af9c56345dae/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2023-12-03 04:14:59,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 04:14:59,571 INFO L206 MainTranslator]: Completed translation [2023-12-03 04:14:59,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59 WrapperNode [2023-12-03 04:14:59,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 04:14:59,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 04:14:59,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 04:14:59,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 04:14:59,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,631 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 486 [2023-12-03 04:14:59,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 04:14:59,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 04:14:59,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 04:14:59,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 04:14:59,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 04:14:59,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 04:14:59,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 04:14:59,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 04:14:59,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:14:59" (1/1) ... [2023-12-03 04:14:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 04:14:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 04:14:59,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 04:14:59,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 04:14:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 04:14:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 04:14:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 04:14:59,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 04:14:59,869 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 04:14:59,872 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 04:15:00,502 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 04:15:01,086 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 04:15:01,086 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 04:15:01,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:15:01 BoogieIcfgContainer [2023-12-03 04:15:01,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 04:15:01,089 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 04:15:01,089 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 04:15:01,098 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 04:15:01,098 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:15:01" (1/1) ... [2023-12-03 04:15:01,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 04:15:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-03 04:15:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-03 04:15:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-03 04:15:01,183 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2023-12-03 04:15:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2023-12-03 04:15:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-03 04:15:03,193 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:03,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2023-12-03 04:15:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2023-12-03 04:15:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-03 04:15:04,406 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:04,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2023-12-03 04:15:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2023-12-03 04:15:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-03 04:15:06,116 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:06,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2023-12-03 04:15:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2023-12-03 04:15:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-03 04:15:07,602 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2023-12-03 04:15:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2023-12-03 04:15:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-03 04:15:09,399 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2023-12-03 04:15:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2023-12-03 04:15:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-03 04:15:11,435 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2023-12-03 04:15:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2023-12-03 04:15:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-03 04:15:11,831 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2023-12-03 04:15:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2023-12-03 04:15:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-03 04:15:11,930 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2023-12-03 04:15:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2023-12-03 04:15:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-03 04:15:15,093 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:15,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2023-12-03 04:15:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2023-12-03 04:15:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-03 04:15:15,665 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 76 states and 133 transitions. [2023-12-03 04:15:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 133 transitions. [2023-12-03 04:15:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-03 04:15:22,699 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 90 states and 163 transitions. [2023-12-03 04:15:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2023-12-03 04:15:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-03 04:15:28,093 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 91 states and 164 transitions. [2023-12-03 04:15:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 164 transitions. [2023-12-03 04:15:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 04:15:29,506 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 105 states and 193 transitions. [2023-12-03 04:15:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 193 transitions. [2023-12-03 04:15:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 04:15:34,710 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 108 states and 202 transitions. [2023-12-03 04:15:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 202 transitions. [2023-12-03 04:15:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 04:15:37,049 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 110 states and 206 transitions. [2023-12-03 04:15:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 206 transitions. [2023-12-03 04:15:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 04:15:38,564 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 124 states and 233 transitions. [2023-12-03 04:15:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 233 transitions. [2023-12-03 04:15:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 04:15:44,229 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:44,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 129 states and 255 transitions. [2023-12-03 04:15:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 255 transitions. [2023-12-03 04:15:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 04:15:49,511 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 131 states and 264 transitions. [2023-12-03 04:15:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 264 transitions. [2023-12-03 04:15:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 04:15:51,145 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 134 states and 272 transitions. [2023-12-03 04:15:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 272 transitions. [2023-12-03 04:15:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 04:15:53,597 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 135 states and 273 transitions. [2023-12-03 04:15:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 273 transitions. [2023-12-03 04:15:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 04:15:54,917 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:54,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 04:15:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 04:15:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 04:15:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 136 states and 274 transitions. [2023-12-03 04:15:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 274 transitions. [2023-12-03 04:15:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 04:15:56,479 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 04:15:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 04:15:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 04:15:56,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 04:15:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 04:15:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 04:15:57,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 04:15:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 04:15:57,324 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 23 iterations. [2023-12-03 04:15:57,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 04:15:57 ImpRootNode [2023-12-03 04:15:57,427 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 04:15:57,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 04:15:57,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 04:15:57,429 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 04:15:57,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:15:01" (3/4) ... [2023-12-03 04:15:57,430 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 04:15:57,544 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 04:15:57,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 04:15:57,545 INFO L158 Benchmark]: Toolchain (without parser) took 58354.83ms. Allocated memory was 146.8MB in the beginning and 799.0MB in the end (delta: 652.2MB). Free memory was 105.0MB in the beginning and 614.7MB in the end (delta: -509.7MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. [2023-12-03 04:15:57,545 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 96.5MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 04:15:57,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.70ms. Allocated memory is still 146.8MB. Free memory was 105.0MB in the beginning and 87.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-03 04:15:57,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.73ms. Allocated memory is still 146.8MB. Free memory was 87.6MB in the beginning and 84.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-03 04:15:57,546 INFO L158 Benchmark]: Boogie Preprocessor took 45.95ms. Allocated memory is still 146.8MB. Free memory was 84.1MB in the beginning and 81.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-03 04:15:57,547 INFO L158 Benchmark]: RCFGBuilder took 1409.04ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 81.6MB in the beginning and 56.5MB in the end (delta: 25.1MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2023-12-03 04:15:57,547 INFO L158 Benchmark]: CodeCheck took 56338.67ms. Allocated memory was 182.5MB in the beginning and 799.0MB in the end (delta: 616.6MB). Free memory was 56.5MB in the beginning and 625.2MB in the end (delta: -568.7MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2023-12-03 04:15:57,547 INFO L158 Benchmark]: Witness Printer took 115.87ms. Allocated memory is still 799.0MB. Free memory was 625.2MB in the beginning and 614.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-03 04:15:57,550 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: 56.2s, OverallIterations: 23, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3003 SdHoareTripleChecker+Valid, 26.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2323 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 24.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 648 mSDsCounter, 1330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8473 IncrementalHoareTripleChecker+Invalid, 9803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1330 mSolverCounterUnsat, 336 mSDtfsCounter, 8473 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3743 GetRequests, 3186 SyntacticMatches, 145 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93864 ImplicationChecksByTransitivity, 31.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 353 ConstructedInterpolants, 0 QuantifiedInterpolants, 2609 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: 610]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND TRUE \read(ep23) [L286] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND TRUE \read(ep31) [L299] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [c1=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, i2=0, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L608] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=1, m2=127, m3=-1, max1=126, max2=0, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 1 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND TRUE (int )m2 > (int )max2 [L146] max2 = m2 [L147] newmax = (_Bool)1 [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L482] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 0) [L509] tmp = 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L608] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L610] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=255, ep32=255, id1=126, id2=0, id3=2, m1=2, m2=2, m3=0, max1=126, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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.26ms. Allocated memory is still 96.5MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.70ms. Allocated memory is still 146.8MB. Free memory was 105.0MB in the beginning and 87.6MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.73ms. Allocated memory is still 146.8MB. Free memory was 87.6MB in the beginning and 84.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.95ms. Allocated memory is still 146.8MB. Free memory was 84.1MB in the beginning and 81.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1409.04ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 81.6MB in the beginning and 56.5MB in the end (delta: 25.1MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * CodeCheck took 56338.67ms. Allocated memory was 182.5MB in the beginning and 799.0MB in the end (delta: 616.6MB). Free memory was 56.5MB in the beginning and 625.2MB in the end (delta: -568.7MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * Witness Printer took 115.87ms. Allocated memory is still 799.0MB. Free memory was 625.2MB in the beginning and 614.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 04:15:57,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a068f284-d565-4fb3-8add-af9c56345dae/bin/ukojak-verify-Qdu7aM0XO9/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