./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b --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 b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 22:33:01,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 22:33:01,433 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 22:33:01,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 22:33:01,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 22:33:01,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 22:33:01,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 22:33:01,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 22:33:01,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 22:33:01,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 22:33:01,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 22:33:01,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 22:33:01,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 22:33:01,461 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 22:33:01,461 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 22:33:01,461 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 22:33:01,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 22:33:01,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 22:33:01,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 22:33:01,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 22:33:01,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 22:33:01,461 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 22:33:01,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 22:33:01,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b 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 -> b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a [2024-12-05 22:33:01,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 22:33:01,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 22:33:01,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 22:33:01,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 22:33:01,698 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 22:33:01,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-12-05 22:33:04,348 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/data/7bfb16380/4be7fc0c317d46f28c30776c054d6ff2/FLAG008af622f [2024-12-05 22:33:04,592 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 22:33:04,592 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-12-05 22:33:04,601 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/data/7bfb16380/4be7fc0c317d46f28c30776c054d6ff2/FLAG008af622f [2024-12-05 22:33:04,614 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/data/7bfb16380/4be7fc0c317d46f28c30776c054d6ff2 [2024-12-05 22:33:04,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 22:33:04,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 22:33:04,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 22:33:04,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 22:33:04,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 22:33:04,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec5912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04, skipping insertion in model container [2024-12-05 22:33:04,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 22:33:04,843 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_2f43d59e-2892-47d2-b17a-c5363872fab1/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2024-12-05 22:33:04,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 22:33:04,856 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 22:33:04,901 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_2f43d59e-2892-47d2-b17a-c5363872fab1/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2024-12-05 22:33:04,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 22:33:04,916 INFO L204 MainTranslator]: Completed translation [2024-12-05 22:33:04,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04 WrapperNode [2024-12-05 22:33:04,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 22:33:04,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 22:33:04,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 22:33:04,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 22:33:04,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,958 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 453 [2024-12-05 22:33:04,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 22:33:04,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 22:33:04,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 22:33:04,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 22:33:04,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 22:33:04,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 22:33:04,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 22:33:04,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 22:33:04,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:33:04" (1/1) ... [2024-12-05 22:33:04,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 22:33:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 22:33:05,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 22:33:05,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 22:33:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 22:33:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 22:33:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 22:33:05,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 22:33:05,138 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 22:33:05,140 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 22:33:05,605 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-12-05 22:33:05,605 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 22:33:06,172 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 22:33:06,172 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-05 22:33:06,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:33:06 BoogieIcfgContainer [2024-12-05 22:33:06,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 22:33:06,173 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 22:33:06,173 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 22:33:06,183 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 22:33:06,183 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:33:06" (1/1) ... [2024-12-05 22:33:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 22:33:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-05 22:33:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-05 22:33:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 22:33:06,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-12-05 22:33:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-12-05 22:33:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 22:33:08,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-12-05 22:33:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-12-05 22:33:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 22:33:09,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-12-05 22:33:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-12-05 22:33:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 22:33:10,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-12-05 22:33:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-12-05 22:33:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-05 22:33:12,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-12-05 22:33:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-12-05 22:33:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 22:33:13,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-12-05 22:33:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-12-05 22:33:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 22:33:14,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-12-05 22:33:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-12-05 22:33:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 22:33:15,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-12-05 22:33:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-12-05 22:33:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 22:33:15,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:15,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-12-05 22:33:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-12-05 22:33:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 22:33:17,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:17,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-12-05 22:33:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-12-05 22:33:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 22:33:17,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 76 states and 134 transitions. [2024-12-05 22:33:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-12-05 22:33:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 22:33:22,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 90 states and 159 transitions. [2024-12-05 22:33:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 159 transitions. [2024-12-05 22:33:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 22:33:25,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 96 states and 177 transitions. [2024-12-05 22:33:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2024-12-05 22:33:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 22:33:27,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 104 states and 204 transitions. [2024-12-05 22:33:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 204 transitions. [2024-12-05 22:33:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 22:33:30,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:30,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 106 states and 212 transitions. [2024-12-05 22:33:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 212 transitions. [2024-12-05 22:33:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 22:33:32,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:32,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 120 states and 245 transitions. [2024-12-05 22:33:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 245 transitions. [2024-12-05 22:33:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 22:33:36,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 124 states and 259 transitions. [2024-12-05 22:33:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 259 transitions. [2024-12-05 22:33:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 22:33:39,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 125 states and 265 transitions. [2024-12-05 22:33:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 265 transitions. [2024-12-05 22:33:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 22:33:40,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:40,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 128 states and 277 transitions. [2024-12-05 22:33:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 277 transitions. [2024-12-05 22:33:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 22:33:42,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 129 states and 281 transitions. [2024-12-05 22:33:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 281 transitions. [2024-12-05 22:33:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 22:33:43,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 130 states and 283 transitions. [2024-12-05 22:33:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 283 transitions. [2024-12-05 22:33:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 22:33:44,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 150 states and 328 transitions. [2024-12-05 22:33:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 328 transitions. [2024-12-05 22:33:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 22:33:52,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:33:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:33:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 155 states and 340 transitions. [2024-12-05 22:33:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 340 transitions. [2024-12-05 22:33:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 22:33:55,811 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:33:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:33:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:33:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 167 states and 367 transitions. [2024-12-05 22:34:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 367 transitions. [2024-12-05 22:34:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-05 22:34:02,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 22:34:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 166 states and 357 transitions. [2024-12-05 22:34:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 357 transitions. [2024-12-05 22:34:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-05 22:34:04,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 180 states and 412 transitions. [2024-12-05 22:34:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 412 transitions. [2024-12-05 22:34:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-05 22:34:12,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 189 states and 428 transitions. [2024-12-05 22:34:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 428 transitions. [2024-12-05 22:34:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 22:34:18,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 201 states and 457 transitions. [2024-12-05 22:34:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 457 transitions. [2024-12-05 22:34:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 22:34:24,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:24,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 216 states and 504 transitions. [2024-12-05 22:34:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 504 transitions. [2024-12-05 22:34:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 22:34:37,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 230 states and 535 transitions. [2024-12-05 22:34:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 535 transitions. [2024-12-05 22:34:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 22:34:49,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:34:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:34:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 239 states and 553 transitions. [2024-12-05 22:34:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 553 transitions. [2024-12-05 22:34:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 22:34:57,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:34:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:34:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:34:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 246 states and 572 transitions. [2024-12-05 22:35:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 572 transitions. [2024-12-05 22:35:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:35:05,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:05,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 257 states and 594 transitions. [2024-12-05 22:35:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 594 transitions. [2024-12-05 22:35:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:35:17,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 269 states and 624 transitions. [2024-12-05 22:35:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 624 transitions. [2024-12-05 22:35:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:35:27,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 270 states and 631 transitions. [2024-12-05 22:35:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 631 transitions. [2024-12-05 22:35:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:35:31,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 275 states and 640 transitions. [2024-12-05 22:35:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 640 transitions. [2024-12-05 22:35:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:35:39,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 276 states and 645 transitions. [2024-12-05 22:35:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 645 transitions. [2024-12-05 22:35:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:35:42,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 277 states and 646 transitions. [2024-12-05 22:35:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 646 transitions. [2024-12-05 22:35:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:35:46,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:35:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:35:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 278 states and 650 transitions. [2024-12-05 22:35:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 650 transitions. [2024-12-05 22:35:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 22:35:48,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:35:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:35:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:35:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:36:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 290 states and 684 transitions. [2024-12-05 22:36:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 684 transitions. [2024-12-05 22:36:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 22:36:00,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:00,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:36:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 294 states and 704 transitions. [2024-12-05 22:36:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 704 transitions. [2024-12-05 22:36:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-05 22:36:05,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:36:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 298 states and 718 transitions. [2024-12-05 22:36:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 718 transitions. [2024-12-05 22:36:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 22:36:11,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:36:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 311 states and 761 transitions. [2024-12-05 22:36:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 761 transitions. [2024-12-05 22:36:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 22:36:25,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:36:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 312 states and 768 transitions. [2024-12-05 22:36:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 768 transitions. [2024-12-05 22:36:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-05 22:36:28,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:36:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 314 states and 771 transitions. [2024-12-05 22:36:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 771 transitions. [2024-12-05 22:36:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-05 22:36:32,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:36:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:36:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:36:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 316 states and 776 transitions. [2024-12-05 22:36:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 776 transitions. [2024-12-05 22:36:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-05 22:36:37,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:36:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:36:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:36:37,776 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 22:36:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:36:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:36:39,025 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 22:36:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:36:39,562 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2024-12-05 22:36:39,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 10:36:39 ImpRootNode [2024-12-05 22:36:39,662 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 22:36:39,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 22:36:39,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 22:36:39,663 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 22:36:39,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:33:06" (3/4) ... [2024-12-05 22:36:39,664 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-05 22:36:39,757 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 182. [2024-12-05 22:36:39,850 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 22:36:39,851 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 22:36:39,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 22:36:39,851 INFO L158 Benchmark]: Toolchain (without parser) took 215233.82ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 116.1MB in the beginning and 481.2MB in the end (delta: -365.1MB). Peak memory consumption was 243.7MB. Max. memory is 16.1GB. [2024-12-05 22:36:39,851 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 22:36:39,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.48ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 99.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 22:36:39,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.32ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 22:36:39,852 INFO L158 Benchmark]: Boogie Preprocessor took 33.56ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 22:36:39,853 INFO L158 Benchmark]: RCFGBuilder took 1179.77ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 102.0MB in the end (delta: -8.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-12-05 22:36:39,853 INFO L158 Benchmark]: CodeCheck took 213488.60ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 102.0MB in the beginning and 506.4MB in the end (delta: -404.3MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. [2024-12-05 22:36:39,853 INFO L158 Benchmark]: Witness Printer took 188.34ms. Allocated memory is still 755.0MB. Free memory was 506.4MB in the beginning and 481.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-05 22:36:39,855 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 213.4s, OverallIterations: 47, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16283 SdHoareTripleChecker+Valid, 98.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14741 mSDsluCounter, 5360 SdHoareTripleChecker+Invalid, 88.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4616 mSDsCounter, 6629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50402 IncrementalHoareTripleChecker+Invalid, 57031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6629 mSolverCounterUnsat, 744 mSDtfsCounter, 50402 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12742 GetRequests, 10975 SyntacticMatches, 663 SemanticMatches, 1104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774462 ImplicationChecksByTransitivity, 158.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 64.0s InterpolantComputationTime, 1293 NumberOfCodeBlocks, 1293 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1199 ConstructedInterpolants, 0 QuantifiedInterpolants, 11535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 11 PerfectInterpolantSequences, 144/707 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, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 567]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND FALSE !(\read(r121)) [L244] COND TRUE \read(r131) [L245] COND TRUE \read(ep32) [L246] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND TRUE \read(r131) [L255] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND TRUE \read(r211) [L268] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND TRUE \read(r321) [L307] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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] [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND TRUE \read(ep13) [L112] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=-2, m2=126, m3=-2, max1=0, max2=125, max3=127, 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=0, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND TRUE (int )m2 > (int )max2 [L141] max2 = m2 [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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 TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L445] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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] [L554] RET assert(c1) [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND TRUE \read(ep13) [L112] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=125, max1=127, max2=127, max3=127, 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=127, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] st1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND TRUE (int )r2 == 2 [L145] COND FALSE !((int )max2 == (int )id2) [L148] nl2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] [L567] reach_error() VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=0, id2=125, id3=127, m1=127, m2=127, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.48ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 99.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.32ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.56ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1179.77ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 102.0MB in the end (delta: -8.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * CodeCheck took 213488.60ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 102.0MB in the beginning and 506.4MB in the end (delta: -404.3MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. * Witness Printer took 188.34ms. Allocated memory is still 755.0MB. Free memory was 506.4MB in the beginning and 481.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-05 22:36:39,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f43d59e-2892-47d2-b17a-c5363872fab1/bin/ukojak-verify-CZk0znPC7b/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