./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/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_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/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_26f97f06-fce3-4c0f-9397-6d280415f1f7/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_26f97f06-fce3-4c0f-9397-6d280415f1f7/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 a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:01:53,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:01:53,855 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 23:01:53,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:01:53,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 23:01:53,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:01:53,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:01:53,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 23:01:53,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:01:53,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:01:53,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:01:53,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:01:53,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:01:53,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:01:53,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:01:53,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:01:53,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:01:53,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:01:53,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:01:53,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:01:53,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:01:53,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:01:53,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:01:53,896 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 23:01:53,896 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 23:01:53,897 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 23:01:53,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:01:53,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:01:53,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:01:53,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:01:53,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:01:53,898 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 23:01:53,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:01:53,898 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_26f97f06-fce3-4c0f-9397-6d280415f1f7/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 -> a10c9e6583b7bb9620d063f223dce3a6f04929588e6f4ac23db6236ec494c7b2 [2024-11-13 23:01:54,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:01:54,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:01:54,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:01:54,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:01:54,251 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:01:54,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 23:01:56,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:01:56,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:01:56,958 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2024-11-13 23:01:56,975 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/data/c516dd738/e9b14d715bdf45e1af84ec96516a3904/FLAG06ff4332e [2024-11-13 23:01:57,001 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/data/c516dd738/e9b14d715bdf45e1af84ec96516a3904 [2024-11-13 23:01:57,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:01:57,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:01:57,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:01:57,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:01:57,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:01:57,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3676a870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57, skipping insertion in model container [2024-11-13 23:01:57,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:01:57,472 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_26f97f06-fce3-4c0f-9397-6d280415f1f7/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-11-13 23:01:57,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:01:57,491 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:01:57,564 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_26f97f06-fce3-4c0f-9397-6d280415f1f7/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c[14521,14534] [2024-11-13 23:01:57,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:01:57,590 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:01:57,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57 WrapperNode [2024-11-13 23:01:57,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:01:57,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:01:57,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:01:57,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:01:57,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,691 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 497 [2024-11-13 23:01:57,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:01:57,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:01:57,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:01:57,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:01:57,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:01:57,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:01:57,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:01:57,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:01:57,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:01:57" (1/1) ... [2024-11-13 23:01:57,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:01:57,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 23:01:57,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 23:01:57,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 23:01:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:01:57,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:01:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:01:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:01:58,029 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:01:58,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:01:59,060 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-13 23:01:59,061 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:02:00,303 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:02:00,303 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:02:00,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:02:00 BoogieIcfgContainer [2024-11-13 23:02:00,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:02:00,305 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 23:02:00,305 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 23:02:00,316 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 23:02:00,317 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:02:00" (1/1) ... [2024-11-13 23:02:00,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:02:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 23:02:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 23:02:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:02:00,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:04,621 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 23:02:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-13 23:02:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-13 23:02:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 23:02:04,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:06,732 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 23:02:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-13 23:02:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-13 23:02:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 23:02:07,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:07,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:08,663 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 23:02:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-13 23:02:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-13 23:02:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:02:09,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:10,879 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 23:02:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-13 23:02:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-13 23:02:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:02:11,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:13,599 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 23:02:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-11-13 23:02:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-13 23:02:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:02:14,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:15,801 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 23:02:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-11-13 23:02:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-11-13 23:02:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:02:17,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:17,832 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 23:02:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-11-13 23:02:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-11-13 23:02:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:02:18,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:18,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:18,475 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 23:02:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-11-13 23:02:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-11-13 23:02:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:02:18,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:18,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:20,240 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 23:02:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-11-13 23:02:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-11-13 23:02:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 23:02:22,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:23,390 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 23:02:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 58 states and 101 transitions. [2024-11-13 23:02:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2024-11-13 23:02:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:02:23,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:27,883 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 23:02:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 74 states and 132 transitions. [2024-11-13 23:02:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2024-11-13 23:02:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 23:02:33,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:35,377 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 23:02:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 88 states and 162 transitions. [2024-11-13 23:02:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 162 transitions. [2024-11-13 23:02:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 23:02:40,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:42,001 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 23:02:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 89 states and 164 transitions. [2024-11-13 23:02:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 164 transitions. [2024-11-13 23:02:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:02:42,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:44,257 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 23:02:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 103 states and 200 transitions. [2024-11-13 23:02:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 200 transitions. [2024-11-13 23:02:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:02:49,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:49,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:51,370 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 23:02:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:02:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 106 states and 209 transitions. [2024-11-13 23:02:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 209 transitions. [2024-11-13 23:02:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 23:02:52,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:02:52,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:02:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:02:54,794 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 23:03:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:03:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 120 states and 239 transitions. [2024-11-13 23:03:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 239 transitions. [2024-11-13 23:03:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 23:03:00,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:03:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:03:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:03:02,273 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 23:03:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:03:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 122 states and 247 transitions. [2024-11-13 23:03:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 247 transitions. [2024-11-13 23:03:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 23:03:03,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:03:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:03:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:03:06,154 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 23:03:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:03:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 127 states and 265 transitions. [2024-11-13 23:03:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 265 transitions. [2024-11-13 23:03:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 23:03:11,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:03:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:03:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:03:12,586 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 23:03:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:03:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 129 states and 268 transitions. [2024-11-13 23:03:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 268 transitions. [2024-11-13 23:03:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:03:13,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:03:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:03:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:03:14,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:03:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:03:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:03:14,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:03:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:03:15,117 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 20 iterations. [2024-11-13 23:03:15,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 11:03:15 ImpRootNode [2024-11-13 23:03:15,274 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 23:03:15,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:03:15,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:03:15,279 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:03:15,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:02:00" (3/4) ... [2024-11-13 23:03:15,281 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 23:03:15,457 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 23:03:15,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:03:15,458 INFO L158 Benchmark]: Toolchain (without parser) took 78452.92ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 91.3MB in the beginning and 1.0GB in the end (delta: -917.4MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2024-11-13 23:03:15,459 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:03:15,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.64ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:03:15,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.19ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 70.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:03:15,460 INFO L158 Benchmark]: Boogie Preprocessor took 46.68ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 68.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:03:15,461 INFO L158 Benchmark]: RCFGBuilder took 2564.11ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 36.9MB in the end (delta: 31.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-11-13 23:03:15,461 INFO L158 Benchmark]: CodeCheck took 74969.62ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 36.9MB in the beginning and 1.0GB in the end (delta: -984.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-13 23:03:15,461 INFO L158 Benchmark]: Witness Printer took 182.37ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:03:15,464 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: 74.8s, OverallIterations: 20, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2267 SdHoareTripleChecker+Valid, 27.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1678 mSDsluCounter, 748 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 957 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6254 IncrementalHoareTripleChecker+Invalid, 7211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 957 mSolverCounterUnsat, 285 mSDtfsCounter, 6254 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3128 GetRequests, 2622 SyntacticMatches, 108 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90308 ImplicationChecksByTransitivity, 40.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 2089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 18/54 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 FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] 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 [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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 FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [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=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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 [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=127, m2=-128, m3=127, max1=126, max2=124, max3=125, 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=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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 FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [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 TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND TRUE (int )m3 > (int )max3 [L200] max3 = m3 [L201] newmax = (_Bool)1 [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=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=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=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=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 [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L610] reach_error() VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=126, id2=124, id3=125, m1=125, m2=125, m3=124, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, 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=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.34ms. Allocated memory is still 83.9MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.64ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.19ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 70.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.68ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 68.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2564.11ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 36.9MB in the end (delta: 31.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * CodeCheck took 74969.62ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 36.9MB in the beginning and 1.0GB in the end (delta: -984.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Witness Printer took 182.37ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB 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 23:03:15,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26f97f06-fce3-4c0f-9397-6d280415f1f7/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