./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fca7014573b2ba8b0b911628482f19638a6ab990 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-01 22:44:57,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 22:44:57,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 22:44:57,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 22:44:57,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 22:44:57,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 22:44:57,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 22:44:57,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 22:44:57,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 22:44:57,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 22:44:57,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 22:44:57,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 22:44:57,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 22:44:57,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 22:44:57,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 22:44:57,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 22:44:57,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 22:44:57,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 22:44:57,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 22:44:57,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 22:44:57,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 22:44:57,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 22:44:57,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 22:44:57,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 22:44:57,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 22:44:57,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 22:44:57,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 22:44:57,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 22:44:57,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 22:44:57,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 22:44:57,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 22:44:57,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 22:44:57,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 22:44:57,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 22:44:57,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 22:44:57,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 22:44:57,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 22:44:57,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 22:44:57,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 22:44:57,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 22:44:57,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 22:44:57,257 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 22:44:57,266 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 22:44:57,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 22:44:57,267 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 22:44:57,267 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 22:44:57,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 22:44:57,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 22:44:57,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 22:44:57,268 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 22:44:57,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 22:44:57,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 22:44:57,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 22:44:57,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 22:44:57,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 22:44:57,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 22:44:57,269 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 22:44:57,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 22:44:57,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 22:44:57,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 22:44:57,269 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 22:44:57,270 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 22:44:57,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 22:44:57,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 22:44:57,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 22:44:57,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 22:44:57,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 22:44:57,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 22:44:57,271 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 22:44:57,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 22:44:57,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 22:44:57,271 INFO L138 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-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(__VERIFIER_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 -> fca7014573b2ba8b0b911628482f19638a6ab990 [2019-12-01 22:44:57,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 22:44:57,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 22:44:57,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 22:44:57,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 22:44:57,386 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 22:44:57,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-12-01 22:44:57,423 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/data/85ffaaf36/997bc623992e46eca0e239e29a74dc24/FLAG580c2e3f9 [2019-12-01 22:44:57,770 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 22:44:57,770 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-12-01 22:44:57,778 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/data/85ffaaf36/997bc623992e46eca0e239e29a74dc24/FLAG580c2e3f9 [2019-12-01 22:44:57,786 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/data/85ffaaf36/997bc623992e46eca0e239e29a74dc24 [2019-12-01 22:44:57,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 22:44:57,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 22:44:57,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 22:44:57,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 22:44:57,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 22:44:57,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:44:57" (1/1) ... [2019-12-01 22:44:57,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b211215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:57, skipping insertion in model container [2019-12-01 22:44:57,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:44:57" (1/1) ... [2019-12-01 22:44:57,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 22:44:57,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 22:44:58,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 22:44:58,014 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 22:44:58,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 22:44:58,062 INFO L208 MainTranslator]: Completed translation [2019-12-01 22:44:58,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58 WrapperNode [2019-12-01 22:44:58,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 22:44:58,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 22:44:58,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 22:44:58,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 22:44:58,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 22:44:58,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 22:44:58,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 22:44:58,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 22:44:58,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... [2019-12-01 22:44:58,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 22:44:58,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 22:44:58,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 22:44:58,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 22:44:58,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:44:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 22:44:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 22:44:58,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 22:44:59,848 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 22:44:59,848 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-01 22:44:59,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:44:59 BoogieIcfgContainer [2019-12-01 22:44:59,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 22:44:59,849 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 22:44:59,850 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 22:44:59,856 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 22:44:59,856 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:44:59" (1/1) ... [2019-12-01 22:44:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 22:44:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:44:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2019-12-01 22:44:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2019-12-01 22:44:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-01 22:44:59,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2019-12-01 22:45:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2019-12-01 22:45:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-01 22:45:00,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2019-12-01 22:45:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2019-12-01 22:45:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-01 22:45:00,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2019-12-01 22:45:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-12-01 22:45:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-01 22:45:01,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2019-12-01 22:45:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2019-12-01 22:45:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-01 22:45:01,555 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2019-12-01 22:45:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2019-12-01 22:45:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-01 22:45:02,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2019-12-01 22:45:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2019-12-01 22:45:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-01 22:45:03,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2019-12-01 22:45:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2019-12-01 22:45:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 22:45:03,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2019-12-01 22:45:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2019-12-01 22:45:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-01 22:45:03,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2019-12-01 22:45:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2019-12-01 22:45:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-01 22:45:05,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2019-12-01 22:45:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2019-12-01 22:45:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 22:45:06,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 74 states and 137 transitions. [2019-12-01 22:45:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 137 transitions. [2019-12-01 22:45:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 22:45:13,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:17,317 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-01 22:45:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 90 states and 168 transitions. [2019-12-01 22:45:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 168 transitions. [2019-12-01 22:45:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-01 22:45:22,172 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 91 states and 171 transitions. [2019-12-01 22:45:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 171 transitions. [2019-12-01 22:45:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 22:45:22,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 103 states and 195 transitions. [2019-12-01 22:45:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 195 transitions. [2019-12-01 22:45:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 22:45:29,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 105 states and 198 transitions. [2019-12-01 22:45:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 198 transitions. [2019-12-01 22:45:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 22:45:30,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 106 states and 201 transitions. [2019-12-01 22:45:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 201 transitions. [2019-12-01 22:45:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:45:31,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:32,019 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-01 22:45:32,577 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-01 22:45:34,996 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-01 22:45:35,711 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-01 22:45:36,928 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-01 22:45:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 124 states and 237 transitions. [2019-12-01 22:45:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 237 transitions. [2019-12-01 22:45:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:45:41,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 127 states and 244 transitions. [2019-12-01 22:45:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 244 transitions. [2019-12-01 22:45:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:45:42,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 128 states and 245 transitions. [2019-12-01 22:45:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 245 transitions. [2019-12-01 22:45:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 22:45:43,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 129 states and 249 transitions. [2019-12-01 22:45:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 249 transitions. [2019-12-01 22:45:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 22:45:43,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:47,329 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-01 22:45:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 137 states and 270 transitions. [2019-12-01 22:45:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 270 transitions. [2019-12-01 22:45:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 22:45:53,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 140 states and 278 transitions. [2019-12-01 22:45:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 278 transitions. [2019-12-01 22:45:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 22:45:54,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 142 states and 280 transitions. [2019-12-01 22:45:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 280 transitions. [2019-12-01 22:45:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 22:45:56,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 144 states and 286 transitions. [2019-12-01 22:45:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 286 transitions. [2019-12-01 22:45:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 22:45:57,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:45:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:45:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 145 states and 287 transitions. [2019-12-01 22:45:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 287 transitions. [2019-12-01 22:45:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 22:45:58,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:45:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:45:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 158 states and 311 transitions. [2019-12-01 22:46:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 311 transitions. [2019-12-01 22:46:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 22:46:05,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 160 states and 317 transitions. [2019-12-01 22:46:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 317 transitions. [2019-12-01 22:46:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 22:46:05,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 163 states and 325 transitions. [2019-12-01 22:46:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 325 transitions. [2019-12-01 22:46:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 22:46:08,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 164 states and 326 transitions. [2019-12-01 22:46:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 326 transitions. [2019-12-01 22:46:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 22:46:09,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 171 states and 344 transitions. [2019-12-01 22:46:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 344 transitions. [2019-12-01 22:46:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 22:46:17,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 174 states and 353 transitions. [2019-12-01 22:46:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 353 transitions. [2019-12-01 22:46:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 22:46:19,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 175 states and 354 transitions. [2019-12-01 22:46:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 354 transitions. [2019-12-01 22:46:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 22:46:20,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 187 states and 382 transitions. [2019-12-01 22:46:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 382 transitions. [2019-12-01 22:46:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 22:46:33,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 190 states and 388 transitions. [2019-12-01 22:46:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 388 transitions. [2019-12-01 22:46:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 22:46:35,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 192 states and 391 transitions. [2019-12-01 22:46:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 391 transitions. [2019-12-01 22:46:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 22:46:36,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 193 states and 392 transitions. [2019-12-01 22:46:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 392 transitions. [2019-12-01 22:46:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 22:46:37,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:46,922 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-12-01 22:46:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 205 states and 418 transitions. [2019-12-01 22:46:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 418 transitions. [2019-12-01 22:46:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 22:46:54,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:46:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:46:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:46:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 206 states and 419 transitions. [2019-12-01 22:46:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 419 transitions. [2019-12-01 22:46:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 22:46:58,779 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:46:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 207 states and 420 transitions. [2019-12-01 22:47:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 420 transitions. [2019-12-01 22:47:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 22:47:02,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 216 states and 435 transitions. [2019-12-01 22:47:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 435 transitions. [2019-12-01 22:47:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 22:47:12,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 218 states and 438 transitions. [2019-12-01 22:47:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 438 transitions. [2019-12-01 22:47:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 22:47:15,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 211 states and 429 transitions. [2019-12-01 22:47:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 429 transitions. [2019-12-01 22:47:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 22:47:16,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 219 states and 447 transitions. [2019-12-01 22:47:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 447 transitions. [2019-12-01 22:47:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 22:47:26,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 216 states and 448 transitions. [2019-12-01 22:47:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 448 transitions. [2019-12-01 22:47:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 22:47:29,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 217 states and 452 transitions. [2019-12-01 22:47:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 452 transitions. [2019-12-01 22:47:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 22:47:30,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:35,878 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-12-01 22:47:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 220 states and 460 transitions. [2019-12-01 22:47:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 460 transitions. [2019-12-01 22:47:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 22:47:38,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 222 states and 468 transitions. [2019-12-01 22:47:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 468 transitions. [2019-12-01 22:47:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-01 22:47:41,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 223 states and 473 transitions. [2019-12-01 22:47:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 473 transitions. [2019-12-01 22:47:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:47:44,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:49,147 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-12-01 22:47:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 226 states and 482 transitions. [2019-12-01 22:47:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 482 transitions. [2019-12-01 22:47:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:47:52,510 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 227 states and 486 transitions. [2019-12-01 22:47:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 486 transitions. [2019-12-01 22:47:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:47:53,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:47:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:47:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 229 states and 488 transitions. [2019-12-01 22:47:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 488 transitions. [2019-12-01 22:47:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-01 22:47:56,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:47:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:47:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:48:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:48:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 232 states and 497 transitions. [2019-12-01 22:48:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 497 transitions. [2019-12-01 22:48:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:48:00,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:48:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:48:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:48:09,270 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-12-01 22:48:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:48:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 234 states and 503 transitions. [2019-12-01 22:48:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 503 transitions. [2019-12-01 22:48:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:48:12,302 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:48:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:48:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:48:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:48:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 235 states and 505 transitions. [2019-12-01 22:48:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 505 transitions. [2019-12-01 22:48:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:48:13,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:48:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:48:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:48:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:48:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 238 states and 513 transitions. [2019-12-01 22:48:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 513 transitions. [2019-12-01 22:48:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-01 22:48:15,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:48:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 22:48:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 22:48:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 22:48:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 242 states and 523 transitions. [2019-12-01 22:48:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 523 transitions. [2019-12-01 22:48:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-01 22:48:19,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 22:48:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:48:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:48:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:48:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 22:48:22,393 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 57 iterations. [2019-12-01 22:48:22,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 10:48:22 ImpRootNode [2019-12-01 22:48:22,491 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 22:48:22,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 22:48:22,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 22:48:22,492 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 22:48:22,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:44:59" (3/4) ... [2019-12-01 22:48:22,494 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 22:48:22,590 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ffa1cf20-7c40-4422-a6a9-0957cbf14b9e/bin/ukojak/witness.graphml [2019-12-01 22:48:22,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 22:48:22,591 INFO L168 Benchmark]: Toolchain (without parser) took 204802.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 943.4 MB in the beginning and 958.8 MB in the end (delta: -15.4 MB). Peak memory consumption was 167.0 MB. Max. memory is 11.5 GB. [2019-12-01 22:48:22,591 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 22:48:22,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -114.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-01 22:48:22,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 22:48:22,592 INFO L168 Benchmark]: Boogie Preprocessor took 26.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 22:48:22,592 INFO L168 Benchmark]: RCFGBuilder took 1723.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 145.5 MB). Peak memory consumption was 255.7 MB. Max. memory is 11.5 GB. [2019-12-01 22:48:22,592 INFO L168 Benchmark]: CodeCheck took 202641.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 906.5 MB in the beginning and 984.7 MB in the end (delta: -78.2 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2019-12-01 22:48:22,593 INFO L168 Benchmark]: Witness Printer took 98.77 ms. Allocated memory is still 1.2 GB. Free memory was 984.7 MB in the beginning and 958.8 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-12-01 22:48:22,594 INFO L335 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, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 202.5s, OverallIterations: 57, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -1845013148 SDslu, 0 SDs, 0 SdLazy, -496710528 SolverSat, 1621133396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16551 GetRequests, 14673 SyntacticMatches, 914 SemanticMatches, 964 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593202 ImplicationChecksByTransitivity, 185.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 1522 NumberOfCodeBlocks, 1522 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1421 ConstructedInterpolants, 0 QuantifiedInterpolants, 503630 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 10 PerfectInterpolantSequences, 170/851 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: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] newmax3 = __VERIFIER_nondet_bool() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND FALSE !(\read(r121)) [L314] COND TRUE \read(r131) [L315] COND TRUE \read(ep32) [L316] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND TRUE \read(r131) [L325] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND TRUE \read(r211) [L338] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND TRUE \read(r211) [L354] COND TRUE \read(ep13) [L355] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND TRUE \read(r321) [L377] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] return (tmp___5); [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND TRUE \read(newmax2) [L213] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L213] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=1, m2=-1, m3=3, max1=2, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND FALSE !((int )m1 > (int )max1) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND TRUE (int )m1 > (int )max1 [L142] max1 = m1 [L143] newmax = (_Bool)1 [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND TRUE (int )m2 > (int )max2 [L196] max2 = m2 [L197] newmax = (_Bool)1 [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND TRUE \read(newmax2) [L213] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L213] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND FALSE !(\read(newmax3)) [L270] COND TRUE \read(ep32) [L271] COND FALSE !(\read(newmax3)) [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=4, m2=4, m3=2, max1=4, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=4, 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] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND FALSE !((int )m1 > (int )max1) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] st1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND FALSE !((int )max2 == (int )id2) [L205] nl2 = (char)1 [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=-1, m2=-1, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=-1, m2=-1, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L566] return (tmp); [L638] c1 = check() [L650] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=-1, m2=-1, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L652] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=2, id2=0, id3=4, m1=-1, m2=-1, m3=4, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -114.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1723.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 145.5 MB). Peak memory consumption was 255.7 MB. Max. memory is 11.5 GB. * CodeCheck took 202641.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 906.5 MB in the beginning and 984.7 MB in the end (delta: -78.2 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Witness Printer took 98.77 ms. Allocated memory is still 1.2 GB. Free memory was 984.7 MB in the beginning and 958.8 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...