./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:46:40,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:46:40,681 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:46:40,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:46:40,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:46:40,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:46:40,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:46:40,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:46:40,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:46:40,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:46:40,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:46:40,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:46:40,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:46:40,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:46:40,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:46:40,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:46:40,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:46:40,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:46:40,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:46:40,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:46:40,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:46:40,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:46:40,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:46:40,727 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:46:40,728 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:46:40,728 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:46:40,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:46:40,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:46:40,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:46:40,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:46:40,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:46:40,729 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:46:40,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:46:40,729 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_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2024-11-13 21:46:41,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:46:41,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:46:41,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:46:41,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:46:41,070 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:46:41,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-13 21:46:43,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:46:43,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:46:43,365 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-11-13 21:46:43,382 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/data/6bd270381/9576ed925ca241be8638f994ba614f02/FLAGb9c72edd8 [2024-11-13 21:46:43,403 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/data/6bd270381/9576ed925ca241be8638f994ba614f02 [2024-11-13 21:46:43,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:46:43,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:46:43,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:46:43,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:46:43,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:46:43,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f29e03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43, skipping insertion in model container [2024-11-13 21:46:43,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:46:43,757 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_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2024-11-13 21:46:43,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:46:43,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:46:43,833 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_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2024-11-13 21:46:43,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:46:43,850 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:46:43,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43 WrapperNode [2024-11-13 21:46:43,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:46:43,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:46:43,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:46:43,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:46:43,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,904 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2024-11-13 21:46:43,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:46:43,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:46:43,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:46:43,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:46:43,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:46:43,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:46:43,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:46:43,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:46:43,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:46:43" (1/1) ... [2024-11-13 21:46:43,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:46:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:46:44,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:46:44,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:46:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:46:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:46:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:46:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:46:44,178 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:46:44,180 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:46:44,934 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-13 21:46:44,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:46:45,666 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:46:45,667 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:46:45,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:46:45 BoogieIcfgContainer [2024-11-13 21:46:45,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:46:45,668 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:46:45,668 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:46:45,678 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:46:45,678 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:46:45" (1/1) ... [2024-11-13 21:46:45,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:46:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:46:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:46:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:46:45,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-11-13 21:46:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-11-13 21:46:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:46:48,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-11-13 21:46:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-11-13 21:46:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:46:49,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-11-13 21:46:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-11-13 21:46:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:46:51,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:51,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-11-13 21:46:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-11-13 21:46:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:46:52,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-11-13 21:46:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-11-13 21:46:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:46:54,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-11-13 21:46:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-11-13 21:46:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:46:56,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-11-13 21:46:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-11-13 21:46:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:46:56,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:46:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:46:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:46:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 57 states and 104 transitions. [2024-11-13 21:46:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 104 transitions. [2024-11-13 21:46:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:46:59,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:46:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:46:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 66 states and 120 transitions. [2024-11-13 21:47:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 120 transitions. [2024-11-13 21:47:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:47:02,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 69 states and 125 transitions. [2024-11-13 21:47:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 125 transitions. [2024-11-13 21:47:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:47:02,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 85 states and 161 transitions. [2024-11-13 21:47:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 161 transitions. [2024-11-13 21:47:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:47:09,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 102 states and 198 transitions. [2024-11-13 21:47:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 198 transitions. [2024-11-13 21:47:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:47:15,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:15,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 103 states and 201 transitions. [2024-11-13 21:47:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 201 transitions. [2024-11-13 21:47:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:47:16,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 121 states and 241 transitions. [2024-11-13 21:47:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 241 transitions. [2024-11-13 21:47:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:47:23,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 122 states and 244 transitions. [2024-11-13 21:47:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 244 transitions. [2024-11-13 21:47:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:47:24,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 123 states and 245 transitions. [2024-11-13 21:47:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 245 transitions. [2024-11-13 21:47:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:47:25,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 124 states and 249 transitions. [2024-11-13 21:47:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2024-11-13 21:47:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:47:26,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 138 states and 279 transitions. [2024-11-13 21:47:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 279 transitions. [2024-11-13 21:47:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:47:33,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:47:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 153 states and 302 transitions. [2024-11-13 21:47:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 302 transitions. [2024-11-13 21:47:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:47:40,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:42,277 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-13 21:47:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 164 states and 326 transitions. [2024-11-13 21:47:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 326 transitions. [2024-11-13 21:47:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:47:49,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:50,305 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-13 21:47:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:47:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 169 states and 339 transitions. [2024-11-13 21:47:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 339 transitions. [2024-11-13 21:47:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:47:52,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:47:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:47:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:47:54,667 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-13 21:48:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 177 states and 357 transitions. [2024-11-13 21:48:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 357 transitions. [2024-11-13 21:48:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:48:00,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:48:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 178 states and 358 transitions. [2024-11-13 21:48:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 358 transitions. [2024-11-13 21:48:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:48:00,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:04,170 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-13 21:48:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 192 states and 412 transitions. [2024-11-13 21:48:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 412 transitions. [2024-11-13 21:48:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:48:12,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:15,233 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-13 21:48:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 206 states and 471 transitions. [2024-11-13 21:48:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 471 transitions. [2024-11-13 21:48:25,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:48:25,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:48:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 217 states and 489 transitions. [2024-11-13 21:48:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 489 transitions. [2024-11-13 21:48:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:48:33,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:36,123 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-13 21:48:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:48:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 237 states and 542 transitions. [2024-11-13 21:48:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 542 transitions. [2024-11-13 21:48:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:48:49,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:48:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:48:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:48:52,588 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-13 21:49:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 246 states and 578 transitions. [2024-11-13 21:49:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 578 transitions. [2024-11-13 21:49:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:49:00,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:03,112 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-13 21:49:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 252 states and 599 transitions. [2024-11-13 21:49:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 599 transitions. [2024-11-13 21:49:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:49:10,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:12,175 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-13 21:49:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 266 states and 626 transitions. [2024-11-13 21:49:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 626 transitions. [2024-11-13 21:49:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:49:22,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:23,650 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-13 21:49:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 271 states and 645 transitions. [2024-11-13 21:49:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 645 transitions. [2024-11-13 21:49:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:49:28,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:29,830 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-13 21:49:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 272 states and 651 transitions. [2024-11-13 21:49:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 651 transitions. [2024-11-13 21:49:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:49:30,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:31,705 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-13 21:49:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 273 states and 657 transitions. [2024-11-13 21:49:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 657 transitions. [2024-11-13 21:49:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:49:32,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:32,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:36,665 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-13 21:49:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:49:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 288 states and 696 transitions. [2024-11-13 21:49:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 696 transitions. [2024-11-13 21:49:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:49:53,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:49:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:49:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:49:56,003 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-13 21:50:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 294 states and 717 transitions. [2024-11-13 21:50:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 717 transitions. [2024-11-13 21:50:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:50:03,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:04,662 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-13 21:50:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 302 states and 750 transitions. [2024-11-13 21:50:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 750 transitions. [2024-11-13 21:50:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:50:12,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:13,709 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-13 21:50:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 303 states and 754 transitions. [2024-11-13 21:50:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 754 transitions. [2024-11-13 21:50:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:50:14,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:18,146 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-13 21:50:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 316 states and 779 transitions. [2024-11-13 21:50:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 779 transitions. [2024-11-13 21:50:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:50:28,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:33,724 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-13 21:50:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 338 states and 807 transitions. [2024-11-13 21:50:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 807 transitions. [2024-11-13 21:50:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:50:42,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:45,483 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-13 21:50:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:50:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 343 states and 831 transitions. [2024-11-13 21:50:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 831 transitions. [2024-11-13 21:50:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:50:53,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:50:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:50:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:50:55,152 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-13 21:51:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 346 states and 847 transitions. [2024-11-13 21:51:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 847 transitions. [2024-11-13 21:51:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:51:00,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:01,354 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-13 21:51:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 350 states and 869 transitions. [2024-11-13 21:51:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 869 transitions. [2024-11-13 21:51:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:51:05,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:06,685 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-13 21:51:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 351 states and 870 transitions. [2024-11-13 21:51:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 870 transitions. [2024-11-13 21:51:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:51:07,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:12,094 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-13 21:51:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 354 states and 883 transitions. [2024-11-13 21:51:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 883 transitions. [2024-11-13 21:51:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:51:19,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:19,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:51:23,683 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-13 21:51:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:51:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 372 states and 931 transitions. [2024-11-13 21:51:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 931 transitions. [2024-11-13 21:51:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:51:41,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:51:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:51:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:51:42,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:51:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:51:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:51:42,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:51:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:51:43,429 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 46 iterations. [2024-11-13 21:51:43,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:51:43 ImpRootNode [2024-11-13 21:51:43,926 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:51:43,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:51:43,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:51:43,928 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:51:43,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:46:45" (3/4) ... [2024-11-13 21:51:43,934 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:51:44,142 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:51:44,142 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:51:44,143 INFO L158 Benchmark]: Toolchain (without parser) took 300735.80ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 92.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 235.2MB. Max. memory is 16.1GB. [2024-11-13 21:51:44,146 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:51:44,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.58ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:51:44,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.57ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 73.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:51:44,147 INFO L158 Benchmark]: Boogie Preprocessor took 44.11ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:51:44,147 INFO L158 Benchmark]: RCFGBuilder took 1713.85ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 39.6MB in the end (delta: 31.5MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-11-13 21:51:44,148 INFO L158 Benchmark]: CodeCheck took 298258.59ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 39.6MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-13 21:51:44,149 INFO L158 Benchmark]: Witness Printer took 214.48ms. Allocated memory is still 3.2GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:51:44,151 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: 297.7s, OverallIterations: 46, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16703 SdHoareTripleChecker+Valid, 120.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15212 mSDsluCounter, 8035 SdHoareTripleChecker+Invalid, 109.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7194 mSDsCounter, 6115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51035 IncrementalHoareTripleChecker+Invalid, 57150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6115 mSolverCounterUnsat, 841 mSDtfsCounter, 51035 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14032 GetRequests, 12303 SyntacticMatches, 485 SemanticMatches, 1244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956035 ImplicationChecksByTransitivity, 236.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 74.3s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1188 ConstructedInterpolants, 0 QuantifiedInterpolants, 12603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 11 PerfectInterpolantSequences, 143/718 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 531]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L452] int c1 ; [L453] int i2 ; [L456] c1 = 0 [L457] ep12 = __VERIFIER_nondet_bool() [L458] ep13 = __VERIFIER_nondet_bool() [L459] ep21 = __VERIFIER_nondet_bool() [L460] ep23 = __VERIFIER_nondet_bool() [L461] ep31 = __VERIFIER_nondet_bool() [L462] ep32 = __VERIFIER_nondet_bool() [L463] id1 = __VERIFIER_nondet_char() [L464] r1 = __VERIFIER_nondet_char() [L465] st1 = __VERIFIER_nondet_char() [L466] nl1 = __VERIFIER_nondet_char() [L467] m1 = __VERIFIER_nondet_char() [L468] max1 = __VERIFIER_nondet_char() [L469] mode1 = __VERIFIER_nondet_bool() [L470] id2 = __VERIFIER_nondet_char() [L471] r2 = __VERIFIER_nondet_char() [L472] st2 = __VERIFIER_nondet_char() [L473] nl2 = __VERIFIER_nondet_char() [L474] m2 = __VERIFIER_nondet_char() [L475] max2 = __VERIFIER_nondet_char() [L476] mode2 = __VERIFIER_nondet_bool() [L477] id3 = __VERIFIER_nondet_char() [L478] r3 = __VERIFIER_nondet_char() [L479] st3 = __VERIFIER_nondet_char() [L480] nl3 = __VERIFIER_nondet_char() [L481] m3 = __VERIFIER_nondet_char() [L482] max3 = __VERIFIER_nondet_char() [L483] mode3 = __VERIFIER_nondet_bool() [L484] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND FALSE !(\read(r131)) [L238] tmp = 0 [L240] r122 = (_Bool )tmp [L241] COND FALSE !(\read(r131)) [L244] COND FALSE !(\read(r121)) [L251] tmp___0 = 0 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND FALSE !(\read(ep31)) [L261] tmp___1 = 0 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND FALSE !(\read(r321)) [L290] tmp___3 = 0 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND FALSE !(\read(r311)) [L303] tmp___4 = 0 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE (int )max1 == (int )id1 [L316] COND TRUE (int )max2 == (int )id2 [L317] COND TRUE (int )max3 == (int )id3 [L318] COND TRUE (int )st1 == 0 [L319] COND TRUE (int )st2 == 0 [L320] COND TRUE (int )st3 == 0 [L321] COND TRUE (int )nl1 == 0 [L322] COND TRUE (int )nl2 == 0 [L323] COND TRUE (int )nl3 == 0 [L324] COND TRUE (int )mode1 == 0 [L325] COND TRUE (int )mode2 == 0 [L326] COND TRUE (int )mode3 == 0 [L327] tmp___5 = 1 [L391] return (tmp___5); [L484] RET, EXPR init() [L484] i2 = init() [L485] COND FALSE !(!(i2)) [L486] p12_old = nomsg [L487] p12_new = nomsg [L488] p13_old = nomsg [L489] p13_new = nomsg [L490] p21_old = nomsg [L491] p21_new = nomsg [L492] p23_old = nomsg [L493] p23_new = nomsg [L494] p31_old = nomsg [L495] p31_new = nomsg [L496] p32_old = nomsg [L497] p32_new = nomsg [L498] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=1, id1=0, id2=2, id3=127, m1=1, m2=127, m3=-2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=2, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=3, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, 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] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND TRUE (int )max1 == (int )id1 [L93] st1 = (char)1 [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L399] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L445] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L531] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=0, id2=2, id3=127, m1=1, m2=127, m3=2, max1=0, max2=2, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 83.9MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.58ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.57ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 73.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.11ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1713.85ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 39.6MB in the end (delta: 31.5MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * CodeCheck took 298258.59ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 39.6MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 214.48ms. Allocated memory is still 3.2GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:51:44,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6ff332-a1e0-47ce-9071-3f4fd9df65b5/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE