./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk --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 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:26:20,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:26:20,551 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:26:20,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:26:20,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:26:20,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:26:20,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:26:20,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:26:20,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:26:20,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:26:20,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:26:20,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:26:20,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:26:20,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:26:20,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:26:20,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:26:20,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:26:20,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:26:20,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:26:20,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:26:20,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:26:20,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:26:20,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:26:20,585 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:26:20,586 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:26:20,586 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:26:20,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:26:20,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:26:20,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:26:20,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:26:20,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:26:20,588 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:26:20,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:26:20,589 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_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/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_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2024-11-08 22:26:20,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:26:20,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:26:20,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:26:20,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:26:20,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:26:20,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 22:26:22,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:26:23,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:26:23,251 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-08 22:26:23,265 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/data/01bf3a5f7/206ece820e4a45648d151800e5399f06/FLAG89f0a026e [2024-11-08 22:26:23,287 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/data/01bf3a5f7/206ece820e4a45648d151800e5399f06 [2024-11-08 22:26:23,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:26:23,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:26:23,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:26:23,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:26:23,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:26:23,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567a6bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23, skipping insertion in model container [2024-11-08 22:26:23,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:26:23,652 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_9eafc76d-4370-44c3-aca9-e85b6f5d3654/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-08 22:26:23,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:26:23,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:26:23,741 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_9eafc76d-4370-44c3-aca9-e85b6f5d3654/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-08 22:26:23,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:26:23,767 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:26:23,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23 WrapperNode [2024-11-08 22:26:23,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:26:23,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:26:23,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:26:23,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:26:23,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,835 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-11-08 22:26:23,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:26:23,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:26:23,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:26:23,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:26:23,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:26:23,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:26:23,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:26:23,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:26:23,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:26:23" (1/1) ... [2024-11-08 22:26:23,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:26:23,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:26:23,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:26:23,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:26:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:26:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:26:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:26:23,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:26:24,136 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:26:24,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:26:24,871 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-08 22:26:24,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:26:25,680 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:26:25,681 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 22:26:25,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:25 BoogieIcfgContainer [2024-11-08 22:26:25,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:26:25,683 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:26:25,683 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:26:25,693 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:26:25,694 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:25" (1/1) ... [2024-11-08 22:26:25,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:26:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2024-11-08 22:26:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2024-11-08 22:26:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:26:25,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:28,512 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-08 22:26:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 24 states and 39 transitions. [2024-11-08 22:26:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2024-11-08 22:26:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 22:26:28,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:30,177 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-08 22:26:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 28 states and 48 transitions. [2024-11-08 22:26:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-08 22:26:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:26:30,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:32,095 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-08 22:26:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 33 states and 59 transitions. [2024-11-08 22:26:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2024-11-08 22:26:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 22:26:32,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:33,890 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-08 22:26:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2024-11-08 22:26:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2024-11-08 22:26:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:26:34,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:36,136 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-08 22:26:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 47 states and 87 transitions. [2024-11-08 22:26:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2024-11-08 22:26:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:26:37,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:37,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:38,111 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-08 22:26:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 54 states and 101 transitions. [2024-11-08 22:26:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2024-11-08 22:26:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:26:39,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:39,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:39,329 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-08 22:26:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 55 states and 101 transitions. [2024-11-08 22:26:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 101 transitions. [2024-11-08 22:26:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:26:39,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:39,640 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-08 22:26:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-11-08 22:26:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-11-08 22:26:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:26:39,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:39,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:41,095 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-08 22:26:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 67 states and 121 transitions. [2024-11-08 22:26:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 121 transitions. [2024-11-08 22:26:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:26:42,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:43,288 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-08 22:26:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 70 states and 126 transitions. [2024-11-08 22:26:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 126 transitions. [2024-11-08 22:26:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:26:43,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:46,334 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-08 22:26:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 88 states and 164 transitions. [2024-11-08 22:26:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 164 transitions. [2024-11-08 22:26:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:26:50,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:51,943 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-08 22:26:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 103 states and 199 transitions. [2024-11-08 22:26:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 199 transitions. [2024-11-08 22:26:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:26:55,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:56,721 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-08 22:26:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 104 states and 201 transitions. [2024-11-08 22:26:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 201 transitions. [2024-11-08 22:26:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:26:57,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:58,793 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-08 22:27:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 119 states and 229 transitions. [2024-11-08 22:27:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 229 transitions. [2024-11-08 22:27:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:27:01,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:03,008 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-08 22:27:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 120 states and 231 transitions. [2024-11-08 22:27:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 231 transitions. [2024-11-08 22:27:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:27:03,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:04,702 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-08 22:27:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 121 states and 235 transitions. [2024-11-08 22:27:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 235 transitions. [2024-11-08 22:27:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:27:05,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:05,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 136 states and 266 transitions. [2024-11-08 22:27:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 266 transitions. [2024-11-08 22:27:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:27:09,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 137 states and 271 transitions. [2024-11-08 22:27:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 271 transitions. [2024-11-08 22:27:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:27:11,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 139 states and 276 transitions. [2024-11-08 22:27:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 276 transitions. [2024-11-08 22:27:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:27:13,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 140 states and 278 transitions. [2024-11-08 22:27:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 278 transitions. [2024-11-08 22:27:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:27:14,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:14,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 141 states and 283 transitions. [2024-11-08 22:27:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 283 transitions. [2024-11-08 22:27:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:27:15,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 163 states and 324 transitions. [2024-11-08 22:27:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 324 transitions. [2024-11-08 22:27:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:27:23,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 168 states and 334 transitions. [2024-11-08 22:27:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 334 transitions. [2024-11-08 22:27:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:27:26,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 177 states and 354 transitions. [2024-11-08 22:27:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 354 transitions. [2024-11-08 22:27:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 22:27:33,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 193 states and 405 transitions. [2024-11-08 22:27:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 405 transitions. [2024-11-08 22:27:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 22:27:44,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 207 states and 439 transitions. [2024-11-08 22:27:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 439 transitions. [2024-11-08 22:27:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:27:52,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 217 states and 458 transitions. [2024-11-08 22:28:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 458 transitions. [2024-11-08 22:28:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:28:00,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 227 states and 477 transitions. [2024-11-08 22:28:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 477 transitions. [2024-11-08 22:28:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:28:07,831 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 240 states and 500 transitions. [2024-11-08 22:28:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 500 transitions. [2024-11-08 22:28:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:28:19,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 245 states and 511 transitions. [2024-11-08 22:28:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 511 transitions. [2024-11-08 22:28:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:28:27,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 251 states and 534 transitions. [2024-11-08 22:28:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 534 transitions. [2024-11-08 22:28:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 22:28:33,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 258 states and 556 transitions. [2024-11-08 22:28:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 556 transitions. [2024-11-08 22:28:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 22:28:41,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 259 states and 557 transitions. [2024-11-08 22:28:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 557 transitions. [2024-11-08 22:28:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 22:28:43,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 261 states and 565 transitions. [2024-11-08 22:28:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 565 transitions. [2024-11-08 22:28:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 22:28:45,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:45,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 265 states and 575 transitions. [2024-11-08 22:28:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 575 transitions. [2024-11-08 22:28:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 22:28:52,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 270 states and 593 transitions. [2024-11-08 22:28:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 593 transitions. [2024-11-08 22:28:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 22:28:58,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:58,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:29:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 271 states and 596 transitions. [2024-11-08 22:29:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 596 transitions. [2024-11-08 22:29:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 22:29:02,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:02,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:29:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 288 states and 639 transitions. [2024-11-08 22:29:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 639 transitions. [2024-11-08 22:29:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 22:29:17,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:17,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:29:18,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:29:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:29:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:29:20,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:29:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:29:20,961 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2024-11-08 22:29:21,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:29:21 ImpRootNode [2024-11-08 22:29:21,126 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:29:21,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:29:21,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:29:21,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:29:21,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:26:25" (3/4) ... [2024-11-08 22:29:21,129 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:29:21,275 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:29:21,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:29:21,276 INFO L158 Benchmark]: Toolchain (without parser) took 177983.08ms. Allocated memory was 211.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 180.6MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 341.5MB. Max. memory is 16.1GB. [2024-11-08 22:29:21,276 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 211.8MB. Free memory is still 186.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:29:21,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.13ms. Allocated memory is still 211.8MB. Free memory was 179.6MB in the beginning and 161.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 22:29:21,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.44ms. Allocated memory is still 211.8MB. Free memory was 161.7MB in the beginning and 157.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:29:21,277 INFO L158 Benchmark]: Boogie Preprocessor took 60.05ms. Allocated memory is still 211.8MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:29:21,277 INFO L158 Benchmark]: RCFGBuilder took 1785.18ms. Allocated memory is still 211.8MB. Free memory was 155.6MB in the beginning and 98.3MB in the end (delta: 57.3MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-11-08 22:29:21,277 INFO L158 Benchmark]: CodeCheck took 175443.53ms. Allocated memory was 211.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 98.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. [2024-11-08 22:29:21,278 INFO L158 Benchmark]: Witness Printer took 148.34ms. Allocated memory is still 2.6GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:29:21,280 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 175.2s, OverallIterations: 39, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11318 SdHoareTripleChecker+Valid, 71.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10074 mSDsluCounter, 7434 SdHoareTripleChecker+Invalid, 64.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4802 mSDsCounter, 3672 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28594 IncrementalHoareTripleChecker+Invalid, 32266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3672 mSolverCounterUnsat, 2632 mSDtfsCounter, 28594 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10764 GetRequests, 9403 SyntacticMatches, 505 SemanticMatches, 856 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438793 ImplicationChecksByTransitivity, 112.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 63.8s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1108 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1018 ConstructedInterpolants, 0 QuantifiedInterpolants, 8817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 10 PerfectInterpolantSequences, 113/593 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: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND TRUE \read(r211) [L271] COND TRUE \read(ep13) [L272] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=0, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=0, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 1 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND TRUE \read(ep13) [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L523] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=1, id1=124, id2=127, id3=125, m1=126, m2=0, m3=127, max1=124, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, 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] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND TRUE (int )m1 > (int )max1 [L81] max1 = m1 [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=2, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=2, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND FALSE !((int )r1 < 1) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND TRUE \read(ep32) [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=3, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, i2=3, id1=124, id2=127, id3=125, m1=125, m2=125, m3=124, max1=127, max2=127, max3=125, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L555] reach_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=124, id2=127, id3=125, m1=125, m2=125, m3=-1, max1=127, max2=127, max3=125, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 211.8MB. Free memory is still 186.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.13ms. Allocated memory is still 211.8MB. Free memory was 179.6MB in the beginning and 161.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.44ms. Allocated memory is still 211.8MB. Free memory was 161.7MB in the beginning and 157.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.05ms. Allocated memory is still 211.8MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1785.18ms. Allocated memory is still 211.8MB. Free memory was 155.6MB in the beginning and 98.3MB in the end (delta: 57.3MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. * CodeCheck took 175443.53ms. Allocated memory was 211.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 98.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. * Witness Printer took 148.34ms. Allocated memory is still 2.6GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:29:21,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eafc76d-4370-44c3-aca9-e85b6f5d3654/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE