./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-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_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3 --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 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:35:47,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:35:47,445 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 04:35:47,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:35:47,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:35:47,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:35:47,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:35:47,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:35:47,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:35:47,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:35:47,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:35:47,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:35:47,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 04:35:47,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:35:47,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 04:35:47,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:35:47,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:35:47,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:35:47,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:35:47,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 04:35:47,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:35:47,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:35:47,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:35:47,504 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:35:47,504 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:35:47,504 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:35:47,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:35:47,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:35:47,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:35:47,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:35:47,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:35:47,505 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:35:47,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:35:47,506 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_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3 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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2024-11-25 04:35:47,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:35:47,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:35:47,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:35:47,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:35:47,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:35:47,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-25 04:35:51,164 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/data/4a5efc206/7236a879db88496cb03e5d1628b6874c/FLAG739788fde [2024-11-25 04:35:51,601 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:35:51,610 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-25 04:35:51,630 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/data/4a5efc206/7236a879db88496cb03e5d1628b6874c/FLAG739788fde [2024-11-25 04:35:51,770 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/data/4a5efc206/7236a879db88496cb03e5d1628b6874c [2024-11-25 04:35:51,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:35:51,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:35:51,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:35:51,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:35:51,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:35:51,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:35:51" (1/1) ... [2024-11-25 04:35:51,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488d5790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:51, skipping insertion in model container [2024-11-25 04:35:51,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:35:51" (1/1) ... [2024-11-25 04:35:51,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:35:52,153 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_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-25 04:35:52,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:35:52,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:35:52,238 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_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-25 04:35:52,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:35:52,256 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:35:52,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52 WrapperNode [2024-11-25 04:35:52,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:35:52,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:35:52,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:35:52,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:35:52,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,313 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-25 04:35:52,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:35:52,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:35:52,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:35:52,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:35:52,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:35:52,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:35:52,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:35:52,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:35:52,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:35:52" (1/1) ... [2024-11-25 04:35:52,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:35:52,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:35:52,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:35:52,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:35:52,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:35:52,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:35:52,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:35:52,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:35:52,607 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:35:52,609 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:35:53,680 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-25 04:35:53,680 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:35:54,835 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:35:54,836 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 04:35:54,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:35:54 BoogieIcfgContainer [2024-11-25 04:35:54,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:35:54,838 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:35:54,839 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:35:54,851 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:35:54,851 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:35:54" (1/1) ... [2024-11-25 04:35:54,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:35:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:35:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-25 04:35:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-25 04:35:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 04:35:54,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:35:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:35:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:35:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:35:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:35:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-25 04:35:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-25 04:35:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 04:35:58,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:35:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:35:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-25 04:36:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-25 04:36:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:36:00,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-25 04:36:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-25 04:36:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:36:02,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-25 04:36:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-25 04:36:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:36:05,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-11-25 04:36:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-25 04:36:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:36:07,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-11-25 04:36:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-11-25 04:36:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:36:10,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-11-25 04:36:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-11-25 04:36:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:36:11,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-11-25 04:36:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-11-25 04:36:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:36:11,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-11-25 04:36:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-11-25 04:36:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:36:15,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 58 states and 101 transitions. [2024-11-25 04:36:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2024-11-25 04:36:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 04:36:16,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2024-11-25 04:36:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2024-11-25 04:36:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 04:36:24,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 88 states and 152 transitions. [2024-11-25 04:36:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2024-11-25 04:36:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:36:30,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 96 states and 169 transitions. [2024-11-25 04:36:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 169 transitions. [2024-11-25 04:36:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:36:35,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:35,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 103 states and 193 transitions. [2024-11-25 04:36:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 193 transitions. [2024-11-25 04:36:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:36:39,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 117 states and 219 transitions. [2024-11-25 04:36:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 219 transitions. [2024-11-25 04:36:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:36:46,289 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:46,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 119 states and 227 transitions. [2024-11-25 04:36:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 227 transitions. [2024-11-25 04:36:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:36:49,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:36:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:36:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 121 states and 232 transitions. [2024-11-25 04:36:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 232 transitions. [2024-11-25 04:36:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 04:36:51,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:36:51,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:36:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:36:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:37:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 140 states and 261 transitions. [2024-11-25 04:37:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 261 transitions. [2024-11-25 04:37:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 04:37:00,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:37:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:37:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 145 states and 275 transitions. [2024-11-25 04:37:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 275 transitions. [2024-11-25 04:37:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 04:37:03,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:37:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:37:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 157 states and 303 transitions. [2024-11-25 04:37:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 303 transitions. [2024-11-25 04:37:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 04:37:13,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:37:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 04:37:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 156 states and 293 transitions. [2024-11-25 04:37:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 293 transitions. [2024-11-25 04:37:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:37:15,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:37:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:37:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 170 states and 339 transitions. [2024-11-25 04:37:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 339 transitions. [2024-11-25 04:37:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:37:27,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:37:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:37:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 179 states and 358 transitions. [2024-11-25 04:37:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 358 transitions. [2024-11-25 04:37:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 04:37:37,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:37:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 04:37:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 193 states and 386 transitions. [2024-11-25 04:37:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 386 transitions. [2024-11-25 04:37:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 04:37:48,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:37:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:37:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:37:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 202 states and 405 transitions. [2024-11-25 04:37:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 405 transitions. [2024-11-25 04:37:59,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 04:37:59,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:37:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:37:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 04:38:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:38:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 203 states and 409 transitions. [2024-11-25 04:38:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 409 transitions. [2024-11-25 04:38:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 04:38:01,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:38:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:38:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:38:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:38:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 216 states and 429 transitions. [2024-11-25 04:38:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 429 transitions. [2024-11-25 04:38:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 04:38:15,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:38:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:38:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:38:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:38:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 226 states and 449 transitions. [2024-11-25 04:38:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 449 transitions. [2024-11-25 04:38:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 04:38:24,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:38:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:38:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:38:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:38:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 227 states and 450 transitions. [2024-11-25 04:38:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 450 transitions. [2024-11-25 04:38:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 04:38:28,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:38:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:38:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:38:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:38:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 229 states and 455 transitions. [2024-11-25 04:38:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 455 transitions. [2024-11-25 04:38:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:38:34,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:38:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:38:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:38:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:38:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 231 states and 465 transitions. [2024-11-25 04:38:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 465 transitions. [2024-11-25 04:38:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:38:41,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:38:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:38:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:38:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:38:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 236 states and 477 transitions. [2024-11-25 04:38:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 477 transitions. [2024-11-25 04:38:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:38:56,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:38:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:38:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:38:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:39:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:39:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 237 states and 483 transitions. [2024-11-25 04:39:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 483 transitions. [2024-11-25 04:39:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:39:01,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:39:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:39:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:39:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:39:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:39:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 243 states and 497 transitions. [2024-11-25 04:39:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 497 transitions. [2024-11-25 04:39:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:39:14,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:39:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:39:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:39:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:39:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:39:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 244 states and 497 transitions. [2024-11-25 04:39:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 497 transitions. [2024-11-25 04:39:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:39:18,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:39:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:39:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:39:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:39:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:39:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 254 states and 529 transitions. [2024-11-25 04:39:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 529 transitions. [2024-11-25 04:39:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:39:36,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:39:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:39:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:39:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:39:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:39:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 257 states and 536 transitions. [2024-11-25 04:39:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 536 transitions. [2024-11-25 04:39:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:39:43,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:39:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:39:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:39:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 267 states and 559 transitions. [2024-11-25 04:40:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 559 transitions. [2024-11-25 04:40:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:40:02,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 268 states and 561 transitions. [2024-11-25 04:40:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 561 transitions. [2024-11-25 04:40:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:40:05,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 269 states and 564 transitions. [2024-11-25 04:40:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 564 transitions. [2024-11-25 04:40:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:40:09,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 270 states and 564 transitions. [2024-11-25 04:40:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 564 transitions. [2024-11-25 04:40:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:40:12,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 271 states and 565 transitions. [2024-11-25 04:40:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 565 transitions. [2024-11-25 04:40:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:40:16,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 284 states and 587 transitions. [2024-11-25 04:40:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 587 transitions. [2024-11-25 04:40:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:40:26,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 288 states and 603 transitions. [2024-11-25 04:40:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 603 transitions. [2024-11-25 04:40:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:40:32,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 289 states and 604 transitions. [2024-11-25 04:40:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 604 transitions. [2024-11-25 04:40:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:40:36,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:36,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 290 states and 605 transitions. [2024-11-25 04:40:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 605 transitions. [2024-11-25 04:40:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:40:39,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 291 states and 608 transitions. [2024-11-25 04:40:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 608 transitions. [2024-11-25 04:40:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:40:42,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:40:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:40:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 293 states and 612 transitions. [2024-11-25 04:40:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 612 transitions. [2024-11-25 04:40:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:40:53,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:40:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:40:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:40:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:41:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:41:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 303 states and 641 transitions. [2024-11-25 04:41:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 641 transitions. [2024-11-25 04:41:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:41:10,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:41:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:41:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:41:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:41:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:41:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 304 states and 645 transitions. [2024-11-25 04:41:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 645 transitions. [2024-11-25 04:41:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:41:18,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:41:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:41:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:41:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:41:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:41:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 305 states and 647 transitions. [2024-11-25 04:41:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 647 transitions. [2024-11-25 04:41:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:41:22,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:41:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:41:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:41:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:41:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:41:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 307 states and 651 transitions. [2024-11-25 04:41:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 651 transitions. [2024-11-25 04:41:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:41:28,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:41:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:41:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:41:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:41:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:41:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 308 states and 652 transitions. [2024-11-25 04:41:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 652 transitions. [2024-11-25 04:41:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 04:41:33,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:41:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:41:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:41:34,509 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:41:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:41:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:41:37,254 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:41:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:41:37,983 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 54 iterations. [2024-11-25 04:41:38,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:41:38 ImpRootNode [2024-11-25 04:41:38,121 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:41:38,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:41:38,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:41:38,122 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:41:38,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:35:54" (3/4) ... [2024-11-25 04:41:38,126 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 04:41:38,349 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 191. [2024-11-25 04:41:38,579 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:41:38,581 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:41:38,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:41:38,583 INFO L158 Benchmark]: Toolchain (without parser) took 346808.16ms. Allocated memory was 117.4MB in the beginning and 788.5MB in the end (delta: 671.1MB). Free memory was 93.1MB in the beginning and 338.5MB in the end (delta: -245.5MB). Peak memory consumption was 420.9MB. Max. memory is 16.1GB. [2024-11-25 04:41:38,583 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 167.8MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:41:38,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.06ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 75.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:41:38,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.92ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 71.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:41:38,585 INFO L158 Benchmark]: Boogie Preprocessor took 44.46ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 69.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:41:38,586 INFO L158 Benchmark]: RCFGBuilder took 2477.93ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 69.7MB in the beginning and 208.7MB in the end (delta: -139.0MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2024-11-25 04:41:38,586 INFO L158 Benchmark]: CodeCheck took 343282.73ms. Allocated memory was 352.3MB in the beginning and 788.5MB in the end (delta: 436.2MB). Free memory was 208.0MB in the beginning and 367.9MB in the end (delta: -159.8MB). Peak memory consumption was 278.9MB. Max. memory is 16.1GB. [2024-11-25 04:41:38,588 INFO L158 Benchmark]: Witness Printer took 459.76ms. Allocated memory is still 788.5MB. Free memory was 367.9MB in the beginning and 338.5MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 04:41:38,590 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: 343.1s, OverallIterations: 54, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22753 SdHoareTripleChecker+Valid, 178.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20909 mSDsluCounter, 6574 SdHoareTripleChecker+Invalid, 162.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5711 mSDsCounter, 8380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62452 IncrementalHoareTripleChecker+Invalid, 70832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8380 mSolverCounterUnsat, 863 mSDtfsCounter, 62452 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15829 GetRequests, 13744 SyntacticMatches, 967 SemanticMatches, 1118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846486 ImplicationChecksByTransitivity, 230.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 125.0s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1545 ConstructedInterpolants, 0 QuantifiedInterpolants, 15872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 11 PerfectInterpolantSequences, 207/1057 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: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND TRUE \read(ep23) [L286] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND TRUE \read(ep31) [L299] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=2, m2=0, m3=126, max1=3, max2=1, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, 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=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND TRUE (int )m1 > (int )max1 [L100] max1 = m1 [L101] newmax = (_Bool)1 [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND TRUE (int )m2 > (int )max2 [L146] max2 = m2 [L147] newmax = (_Bool)1 [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND FALSE !(\read(newmax3)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=127, m2=3, m3=1, max1=127, max2=3, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND TRUE (int )m2 > (int )max2 [L146] max2 = m2 [L147] newmax = (_Bool)1 [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND FALSE !((int )max2 == (int )id2) [L163] nl2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=-1, m2=127, m3=3, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=-1, m2=127, m3=3, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=-1, m2=127, m3=3, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L609] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=3, id2=1, id3=127, m1=-1, m2=127, m3=3, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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.51ms. Allocated memory is still 167.8MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.06ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 75.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.92ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 71.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.46ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 69.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2477.93ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 69.7MB in the beginning and 208.7MB in the end (delta: -139.0MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. * CodeCheck took 343282.73ms. Allocated memory was 352.3MB in the beginning and 788.5MB in the end (delta: 436.2MB). Free memory was 208.0MB in the beginning and 367.9MB in the end (delta: -159.8MB). Peak memory consumption was 278.9MB. Max. memory is 16.1GB. * Witness Printer took 459.76ms. Allocated memory is still 788.5MB. Free memory was 367.9MB in the beginning and 338.5MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 04:41:38,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a32b32ef-01e6-4c8e-9cbb-dd6249001cb9/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE