./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.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_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/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 e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 21:49:00,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 21:49:00,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 21:49:00,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 21:49:00,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 21:49:00,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 21:49:00,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 21:49:00,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 21:49:00,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 21:49:00,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 21:49:00,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 21:49:00,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 21:49:00,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 21:49:00,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 21:49:00,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 21:49:00,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 21:49:00,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 21:49:00,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 21:49:00,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 21:49:00,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 21:49:00,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 21:49:00,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 21:49:00,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 21:49:00,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 21:49:00,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 21:49:00,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 21:49:00,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 21:49:00,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 21:49:00,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 21:49:00,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 21:49:00,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 21:49:00,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 21:49:00,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 21:49:00,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 21:49:00,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 21:49:00,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 21:49:00,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 21:49:00,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 21:49:00,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 21:49:00,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 21:49:00,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 21:49:00,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 21:49:00,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 21:49:00,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 21:49:00,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 21:49:00,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 21:49:00,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 21:49:00,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 21:49:00,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 21:49:00,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 21:49:00,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 21:49:00,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 21:49:00,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 21:49:00,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 21:49:00,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 21:49:00,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 21:49:00,743 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 21:49:00,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 21:49:00,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 21:49:00,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 21:49:00,744 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 21:49:00,744 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 21:49:00,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 21:49:00,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 21:49:00,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 21:49:00,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 21:49:00,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 21:49:00,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 21:49:00,746 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 21:49:00,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 21:49:00,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 21:49:00,746 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_23886fbd-f54b-4622-b0cf-70bec30798c4/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 -> e933d4cdc4956da0da3b7a9eafbe7f31dfa7607e [2019-12-01 21:49:00,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 21:49:00,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 21:49:00,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 21:49:00,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 21:49:00,861 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 21:49:00,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-12-01 21:49:00,909 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/data/c0fbe063b/f0d018b0f2654862bf766bc9bafdef14/FLAG3c0f8ace0 [2019-12-01 21:49:01,282 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 21:49:01,283 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-12-01 21:49:01,291 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/data/c0fbe063b/f0d018b0f2654862bf766bc9bafdef14/FLAG3c0f8ace0 [2019-12-01 21:49:01,300 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/data/c0fbe063b/f0d018b0f2654862bf766bc9bafdef14 [2019-12-01 21:49:01,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 21:49:01,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 21:49:01,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 21:49:01,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 21:49:01,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 21:49:01,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3272d5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01, skipping insertion in model container [2019-12-01 21:49:01,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 21:49:01,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 21:49:01,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 21:49:01,592 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 21:49:01,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 21:49:01,682 INFO L208 MainTranslator]: Completed translation [2019-12-01 21:49:01,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01 WrapperNode [2019-12-01 21:49:01,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 21:49:01,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 21:49:01,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 21:49:01,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 21:49:01,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 21:49:01,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 21:49:01,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 21:49:01,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 21:49:01,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... [2019-12-01 21:49:01,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 21:49:01,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 21:49:01,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 21:49:01,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 21:49:01,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 09:49:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/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 21:49:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 21:49:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 21:49:02,874 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 21:49:02,874 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-01 21:49:02,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:49:02 BoogieIcfgContainer [2019-12-01 21:49:02,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 21:49:02,876 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 21:49:02,876 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 21:49:02,883 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 21:49:02,883 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:49:02" (1/1) ... [2019-12-01 21:49:02,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 21:49:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 173 states and 303 transitions. [2019-12-01 21:49:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2019-12-01 21:49:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-01 21:49:02,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:03,325 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 21:49:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 184 states and 330 transitions. [2019-12-01 21:49:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-12-01 21:49:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 21:49:03,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:03,460 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 21:49:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 184 states and 328 transitions. [2019-12-01 21:49:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 328 transitions. [2019-12-01 21:49:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 21:49:03,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:03,608 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 21:49:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 190 states and 341 transitions. [2019-12-01 21:49:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 341 transitions. [2019-12-01 21:49:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 21:49:03,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:03,837 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 21:49:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 192 states and 345 transitions. [2019-12-01 21:49:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 345 transitions. [2019-12-01 21:49:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 21:49:03,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:03,910 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 21:49:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:04,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 204 states and 372 transitions. [2019-12-01 21:49:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 372 transitions. [2019-12-01 21:49:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 21:49:04,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:04,304 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 21:49:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 205 states and 373 transitions. [2019-12-01 21:49:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 373 transitions. [2019-12-01 21:49:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 21:49:04,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:04,363 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 21:49:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 207 states and 379 transitions. [2019-12-01 21:49:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 379 transitions. [2019-12-01 21:49:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:04,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:04,751 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 21:49:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 214 states and 398 transitions. [2019-12-01 21:49:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 398 transitions. [2019-12-01 21:49:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:08,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:08,348 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 21:49:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 214 states and 397 transitions. [2019-12-01 21:49:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 397 transitions. [2019-12-01 21:49:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:14,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:14,911 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 21:49:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 221 states and 416 transitions. [2019-12-01 21:49:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 416 transitions. [2019-12-01 21:49:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:21,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:21,113 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 21:49:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 230 states and 437 transitions. [2019-12-01 21:49:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 437 transitions. [2019-12-01 21:49:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:22,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:23,025 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 21:49:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 234 states and 443 transitions. [2019-12-01 21:49:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 443 transitions. [2019-12-01 21:49:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:23,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:23,273 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 21:49:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 237 states and 450 transitions. [2019-12-01 21:49:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 450 transitions. [2019-12-01 21:49:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:24,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:24,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 21:49:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 250 states and 483 transitions. [2019-12-01 21:49:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 483 transitions. [2019-12-01 21:49:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:34,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:34,710 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 21:49:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 251 states and 483 transitions. [2019-12-01 21:49:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 483 transitions. [2019-12-01 21:49:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:35,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:35,122 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 21:49:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 255 states and 489 transitions. [2019-12-01 21:49:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 489 transitions. [2019-12-01 21:49:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 21:49:35,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:35,738 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 21:49:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 258 states and 498 transitions. [2019-12-01 21:49:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 498 transitions. [2019-12-01 21:49:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:37,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:37,652 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 21:49:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 259 states and 501 transitions. [2019-12-01 21:49:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 501 transitions. [2019-12-01 21:49:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:39,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:39,586 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 21:49:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 260 states and 504 transitions. [2019-12-01 21:49:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 504 transitions. [2019-12-01 21:49:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:40,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:40,494 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 21:49:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 261 states and 506 transitions. [2019-12-01 21:49:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 506 transitions. [2019-12-01 21:49:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:42,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:42,347 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 21:49:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 266 states and 519 transitions. [2019-12-01 21:49:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 519 transitions. [2019-12-01 21:49:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:44,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:44,888 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 21:49:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 267 states and 520 transitions. [2019-12-01 21:49:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 520 transitions. [2019-12-01 21:49:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:44,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:44,928 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 21:49:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 268 states and 522 transitions. [2019-12-01 21:49:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 522 transitions. [2019-12-01 21:49:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:45,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:45,851 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 21:49:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 255 states and 470 transitions. [2019-12-01 21:49:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 470 transitions. [2019-12-01 21:49:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:48,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:49,012 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 21:49:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 263 states and 488 transitions. [2019-12-01 21:49:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 488 transitions. [2019-12-01 21:49:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:54,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:54,220 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 21:49:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 265 states and 491 transitions. [2019-12-01 21:49:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 491 transitions. [2019-12-01 21:49:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:55,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:55,811 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 21:49:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:49:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 269 states and 498 transitions. [2019-12-01 21:49:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 498 transitions. [2019-12-01 21:49:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:49:57,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:49:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:49:58,197 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 21:50:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 278 states and 518 transitions. [2019-12-01 21:50:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 518 transitions. [2019-12-01 21:50:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:50:03,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:03,906 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 21:50:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 282 states and 523 transitions. [2019-12-01 21:50:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 523 transitions. [2019-12-01 21:50:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:50:07,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:07,050 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 21:50:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 284 states and 527 transitions. [2019-12-01 21:50:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 527 transitions. [2019-12-01 21:50:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:50:08,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:08,580 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 21:50:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 286 states and 531 transitions. [2019-12-01 21:50:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 531 transitions. [2019-12-01 21:50:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-01 21:50:10,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:10,536 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 21:50:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 290 states and 541 transitions. [2019-12-01 21:50:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 541 transitions. [2019-12-01 21:50:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:50:15,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:15,883 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 21:50:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 293 states and 543 transitions. [2019-12-01 21:50:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 543 transitions. [2019-12-01 21:50:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:50:20,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:20,605 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 21:50:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 295 states and 545 transitions. [2019-12-01 21:50:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 545 transitions. [2019-12-01 21:50:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:50:25,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:25,186 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 21:50:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:50:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 292 states and 537 transitions. [2019-12-01 21:50:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 537 transitions. [2019-12-01 21:50:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:50:28,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:50:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:50:30,497 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 21:51:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:51:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 305 states and 562 transitions. [2019-12-01 21:51:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 562 transitions. [2019-12-01 21:51:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:51:07,053 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:51:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:51:07,081 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 21:51:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:51:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 308 states and 567 transitions. [2019-12-01 21:51:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 567 transitions. [2019-12-01 21:51:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:51:10,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:51:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:51:11,848 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 21:51:21,005 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-01 21:51:39,490 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-01 21:51:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:51:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 313 states and 574 transitions. [2019-12-01 21:51:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 574 transitions. [2019-12-01 21:51:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:51:52,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:51:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:51:52,941 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 21:51:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:51:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 313 states and 573 transitions. [2019-12-01 21:51:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 573 transitions. [2019-12-01 21:51:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:51:57,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:51:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:51:57,438 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 21:52:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 317 states and 584 transitions. [2019-12-01 21:52:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 584 transitions. [2019-12-01 21:52:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:04,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 21:52:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 321 states and 589 transitions. [2019-12-01 21:52:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 589 transitions. [2019-12-01 21:52:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:09,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:09,386 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 21:52:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 322 states and 590 transitions. [2019-12-01 21:52:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 590 transitions. [2019-12-01 21:52:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:10,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:10,816 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 21:52:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 326 states and 596 transitions. [2019-12-01 21:52:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 596 transitions. [2019-12-01 21:52:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:14,889 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:17,558 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 21:52:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 339 states and 626 transitions. [2019-12-01 21:52:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 626 transitions. [2019-12-01 21:52:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:32,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:32,097 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 21:52:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 343 states and 631 transitions. [2019-12-01 21:52:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 631 transitions. [2019-12-01 21:52:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:36,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:36,962 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 21:52:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 347 states and 637 transitions. [2019-12-01 21:52:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 637 transitions. [2019-12-01 21:52:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:37,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:37,649 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 21:52:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 349 states and 639 transitions. [2019-12-01 21:52:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 639 transitions. [2019-12-01 21:52:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:38,871 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:38,895 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 21:52:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 351 states and 644 transitions. [2019-12-01 21:52:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 644 transitions. [2019-12-01 21:52:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:44,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:44,685 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 21:52:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 355 states and 650 transitions. [2019-12-01 21:52:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 650 transitions. [2019-12-01 21:52:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:47,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:47,975 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 21:52:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:52:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 357 states and 653 transitions. [2019-12-01 21:52:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 653 transitions. [2019-12-01 21:52:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:52:53,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:52:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:52:54,526 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 21:53:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 366 states and 672 transitions. [2019-12-01 21:53:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 672 transitions. [2019-12-01 21:53:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 21:53:19,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:19,641 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 21:53:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 370 states and 678 transitions. [2019-12-01 21:53:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 678 transitions. [2019-12-01 21:53:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:53:21,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:21,416 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 21:53:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 369 states and 672 transitions. [2019-12-01 21:53:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 672 transitions. [2019-12-01 21:53:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:53:29,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:29,397 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 21:53:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 373 states and 680 transitions. [2019-12-01 21:53:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 680 transitions. [2019-12-01 21:53:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:53:32,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:32,666 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 21:53:38,004 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-01 21:53:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 372 states and 676 transitions. [2019-12-01 21:53:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 676 transitions. [2019-12-01 21:53:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:53:40,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:40,360 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 21:53:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 367 states and 666 transitions. [2019-12-01 21:53:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 666 transitions. [2019-12-01 21:53:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:53:48,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:48,268 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 21:53:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 371 states and 673 transitions. [2019-12-01 21:53:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 673 transitions. [2019-12-01 21:53:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:53:51,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:51,885 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 21:53:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:53:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 370 states and 670 transitions. [2019-12-01 21:53:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 670 transitions. [2019-12-01 21:53:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:53:54,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:53:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:53:54,676 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 21:54:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 378 states and 686 transitions. [2019-12-01 21:54:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 686 transitions. [2019-12-01 21:54:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:04,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:04,876 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 21:54:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 377 states and 684 transitions. [2019-12-01 21:54:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 684 transitions. [2019-12-01 21:54:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:10,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:10,275 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 21:54:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 386 states and 698 transitions. [2019-12-01 21:54:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 698 transitions. [2019-12-01 21:54:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:18,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:18,083 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 21:54:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 385 states and 695 transitions. [2019-12-01 21:54:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 695 transitions. [2019-12-01 21:54:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:22,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:22,458 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 21:54:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 390 states and 702 transitions. [2019-12-01 21:54:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 702 transitions. [2019-12-01 21:54:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:28,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:28,841 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 21:54:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 364 states and 648 transitions. [2019-12-01 21:54:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 648 transitions. [2019-12-01 21:54:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:37,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:37,217 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 21:54:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 366 states and 650 transitions. [2019-12-01 21:54:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 650 transitions. [2019-12-01 21:54:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:39,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:39,284 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 21:54:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 373 states and 660 transitions. [2019-12-01 21:54:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 660 transitions. [2019-12-01 21:54:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:47,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:47,068 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 21:54:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:54:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 375 states and 664 transitions. [2019-12-01 21:54:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 664 transitions. [2019-12-01 21:54:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:54:47,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:54:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:54:48,357 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 21:55:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:55:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 392 states and 699 transitions. [2019-12-01 21:55:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 699 transitions. [2019-12-01 21:55:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:55:08,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:55:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:55:08,598 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 21:55:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:55:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 394 states and 702 transitions. [2019-12-01 21:55:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 702 transitions. [2019-12-01 21:55:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:55:16,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:55:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:55:16,628 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 21:55:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:55:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 396 states and 705 transitions. [2019-12-01 21:55:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 705 transitions. [2019-12-01 21:55:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:55:24,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:55:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:55:24,946 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 21:55:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:55:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 403 states and 716 transitions. [2019-12-01 21:55:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 716 transitions. [2019-12-01 21:55:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:55:34,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:55:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:55:34,813 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 21:55:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:55:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 405 states and 720 transitions. [2019-12-01 21:55:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 720 transitions. [2019-12-01 21:55:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:55:41,480 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:55:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:55:41,496 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 21:55:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:55:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 407 states and 723 transitions. [2019-12-01 21:55:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 723 transitions. [2019-12-01 21:55:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-01 21:55:45,653 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:55:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:55:45,667 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 21:55:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:55:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 416 states and 738 transitions. [2019-12-01 21:55:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 738 transitions. [2019-12-01 21:55:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 21:55:58,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:55:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:55:59,964 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 21:56:05,592 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-12-01 21:56:08,984 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-12-01 21:56:12,596 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-12-01 21:57:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:57:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 424 states and 751 transitions. [2019-12-01 21:57:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 751 transitions. [2019-12-01 21:57:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 21:57:10,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:57:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 21:57:10,065 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 21:57:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 21:57:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 427 states and 755 transitions. [2019-12-01 21:57:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 755 transitions. [2019-12-01 21:57:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 21:57:16,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 21:57:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 21:57:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 21:57:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 21:57:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 21:57:17,240 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 77 iterations. [2019-12-01 21:57:17,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 09:57:17 ImpRootNode [2019-12-01 21:57:17,374 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 21:57:17,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 21:57:17,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 21:57:17,375 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 21:57:17,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 09:49:02" (3/4) ... [2019-12-01 21:57:17,377 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 21:57:17,486 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_23886fbd-f54b-4622-b0cf-70bec30798c4/bin/ukojak/witness.graphml [2019-12-01 21:57:17,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 21:57:17,487 INFO L168 Benchmark]: Toolchain (without parser) took 496183.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.7 MB in the beginning and 824.4 MB in the end (delta: 116.3 MB). Peak memory consumption was 251.1 MB. Max. memory is 11.5 GB. [2019-12-01 21:57:17,487 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 21:57:17,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-01 21:57:17,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.52 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 21:57:17,487 INFO L168 Benchmark]: Boogie Preprocessor took 30.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 21:57:17,487 INFO L168 Benchmark]: RCFGBuilder took 1115.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 863.9 MB in the end (delta: 225.7 MB). Peak memory consumption was 225.7 MB. Max. memory is 11.5 GB. [2019-12-01 21:57:17,488 INFO L168 Benchmark]: CodeCheck took 494498.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 23.6 MB). Free memory was 863.9 MB in the beginning and 864.0 MB in the end (delta: -34.3 kB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. [2019-12-01 21:57:17,488 INFO L168 Benchmark]: Witness Printer took 111.14 ms. Allocated memory is still 1.2 GB. Free memory was 864.0 MB in the beginning and 824.4 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2019-12-01 21:57:17,489 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, 173 locations, 1 error locations. Result: UNSAFE, OverallTime: 494.3s, OverallIterations: 77, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -1839880696 SDtfs, -582617948 SDslu, -546673468 SDs, 0 SdLazy, -1107665864 SolverSat, 1342719632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 95.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50964 GetRequests, 48924 SyntacticMatches, 676 SemanticMatches, 1364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961307 ImplicationChecksByTransitivity, 486.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 6367 NumberOfCodeBlocks, 6367 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 6203 ConstructedInterpolants, 0 QuantifiedInterpolants, 2184054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 76 PerfectInterpolantSequences, 0/0 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: 572]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] _Bool newmax1 = 0; [L44] char id2 = '\x0'; [L45] char r2 = '\x0'; [L46] char st2 = '\x0'; [L47] char nl2 = '\x0'; [L48] char m2 = '\x0'; [L49] char max2 = '\x0'; [L50] _Bool mode2 = 0; [L51] _Bool newmax2 = 0; [L52] char id3 = '\x0'; [L53] char r3 = '\x0'; [L54] char st3 = '\x0'; [L55] char nl3 = '\x0'; [L56] char m3 = '\x0'; [L57] char max3 = '\x0'; [L58] _Bool mode3 = 0; [L59] _Bool newmax3 = 0; [L63] void (*nodes[3])() = { &node1, &node2, &node3 }; [L67] int __return_1237; [L68] int __return_1383; [L69] int __return_1517; [L70] int __tmp_1518_0; [L71] int __return_1641; [L72] int __return_1531; [L75] int main__c1; [L76] int main__i2; [L77] main__c1 = 0 [L78] ep12 = __VERIFIER_nondet_bool() [L79] ep13 = __VERIFIER_nondet_bool() [L80] ep21 = __VERIFIER_nondet_bool() [L81] ep23 = __VERIFIER_nondet_bool() [L82] ep31 = __VERIFIER_nondet_bool() [L83] ep32 = __VERIFIER_nondet_bool() [L84] id1 = __VERIFIER_nondet_char() [L85] r1 = __VERIFIER_nondet_char() [L86] st1 = __VERIFIER_nondet_char() [L87] nl1 = __VERIFIER_nondet_char() [L88] m1 = __VERIFIER_nondet_char() [L89] max1 = __VERIFIER_nondet_char() [L90] mode1 = __VERIFIER_nondet_bool() [L91] newmax1 = __VERIFIER_nondet_bool() [L92] id2 = __VERIFIER_nondet_char() [L93] r2 = __VERIFIER_nondet_char() [L94] st2 = __VERIFIER_nondet_char() [L95] nl2 = __VERIFIER_nondet_char() [L96] m2 = __VERIFIER_nondet_char() [L97] max2 = __VERIFIER_nondet_char() [L98] mode2 = __VERIFIER_nondet_bool() [L99] newmax2 = __VERIFIER_nondet_bool() [L100] id3 = __VERIFIER_nondet_char() [L101] r3 = __VERIFIER_nondet_char() [L102] st3 = __VERIFIER_nondet_char() [L103] nl3 = __VERIFIER_nondet_char() [L104] m3 = __VERIFIER_nondet_char() [L105] max3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L107] newmax3 = __VERIFIER_nondet_bool() [L109] _Bool init__r121; [L110] _Bool init__r131; [L111] _Bool init__r211; [L112] _Bool init__r231; [L113] _Bool init__r311; [L114] _Bool init__r321; [L115] _Bool init__r122; [L116] int init__tmp; [L117] _Bool init__r132; [L118] int init__tmp___0; [L119] _Bool init__r212; [L120] int init__tmp___1; [L121] _Bool init__r232; [L122] int init__tmp___2; [L123] _Bool init__r312; [L124] int init__tmp___3; [L125] _Bool init__r322; [L126] int init__tmp___4; [L127] int init__tmp___5; [L128] init__r121 = ep12 [L129] init__r131 = ep13 [L130] init__r211 = ep21 [L131] init__r231 = ep23 [L132] init__r311 = ep31 [L133] init__r321 = ep32 [L134] COND TRUE !(init__r121 == 0) [L136] init__tmp = 1 [L138] init__r122 = (_Bool)init__tmp [L139] COND FALSE !(!(init__r131 == 0)) [L1741] COND TRUE !(init__r121 == 0) [L1743] COND TRUE !(ep23 == 0) [L1745] init__tmp___0 = 1 [L143] init__r132 = (_Bool)init__tmp___0 [L144] COND FALSE !(!(init__r211 == 0)) [L1718] COND TRUE !(init__r231 == 0) [L1720] COND TRUE !(ep31 == 0) [L1722] init__tmp___1 = 1 [L148] init__r212 = (_Bool)init__tmp___1 [L149] COND TRUE !(init__r231 == 0) [L151] init__tmp___2 = 1 [L153] init__r232 = (_Bool)init__tmp___2 [L154] COND TRUE !(init__r311 == 0) [L156] init__tmp___3 = 1 [L158] init__r312 = (_Bool)init__tmp___3 [L159] COND FALSE !(!(init__r321 == 0)) [L1649] COND TRUE !(init__r311 == 0) [L1651] COND TRUE !(ep12 == 0) [L1653] init__tmp___4 = 1 [L163] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L170] COND TRUE ((int)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE !(init__r122 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE !(init__r132 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE !(init__r212 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE !(init__r232 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE !(init__r312 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r322 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE ((int)st1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE ((int)st2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)st3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)nl1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)nl2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)nl3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)mode1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)mode2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)mode3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE !(newmax1 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE !(newmax2 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE !(newmax3 == 0) [L224] init__tmp___5 = 1 [L225] __return_1237 = init__tmp___5 [L226] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE main__i2 != 0 [L229] p12_old = nomsg [L230] p12_new = nomsg [L231] p13_old = nomsg [L232] p13_new = nomsg [L233] p21_old = nomsg [L234] p21_new = nomsg [L235] p23_old = nomsg [L236] p23_new = nomsg [L237] p31_old = nomsg [L238] p31_new = nomsg [L239] p32_old = nomsg [L240] p32_new = nomsg [L241] main__i2 = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L242] COND TRUE main__i2 < 6 [L245] _Bool node1__newmax; [L246] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L247] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L253] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L255] COND TRUE !(ep12 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L257] COND TRUE !(newmax1 == 0) [L259] int node1____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L260] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L262] COND TRUE p12_new == nomsg [L264] node1____CPAchecker_TMP_0 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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] [L266] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L268] COND FALSE !(!(ep13 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L281] mode1 = 1 [L283] _Bool node2__newmax; [L284] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L285] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L291] COND TRUE ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L293] COND FALSE !(!(ep21 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L306] COND TRUE !(ep23 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L308] COND TRUE !(newmax2 == 0) [L310] int node2____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L311] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L313] COND TRUE p23_new == nomsg [L315] node2____CPAchecker_TMP_1 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, 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] [L317] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L319] mode2 = 1 [L321] _Bool node3__newmax; [L322] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L323] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L329] COND TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L331] COND TRUE !(ep31 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L333] COND TRUE !(newmax3 == 0) [L335] int node3____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L336] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L338] COND TRUE p31_new == nomsg [L340] node3____CPAchecker_TMP_0 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, 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] [L342] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND FALSE !(!(ep32 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=125, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] mode3 = 1 [L358] p12_old = p12_new [L359] p12_new = nomsg [L360] p13_old = p13_new [L361] p13_new = nomsg [L362] p21_old = p21_new [L363] p21_new = nomsg [L364] p23_old = p23_new [L365] p23_new = nomsg [L366] p31_old = p31_new [L367] p31_new = nomsg [L368] p32_old = p32_new [L369] p32_new = nomsg [L371] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L378] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L396] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND TRUE ((int)r1) < 2 [L400] check__tmp = 1 [L401] __return_1383 = check__tmp [L402] main__c1 = __return_1383 [L404] _Bool __tmp_1; [L405] __tmp_1 = main__c1 [L406] _Bool assert__arg; [L407] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND FALSE !(assert__arg == 0) [L414] int main____CPAchecker_TMP_0 = main__i2; [L415] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE main__i2 < 6 [L419] _Bool node1__newmax; [L420] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, 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=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE !(mode1 == 0) [L423] r1 = (char)(((int)r1) + 1) [L424] COND FALSE !(!(ep21 == 0)) [L433] COND TRUE !(ep31 == 0) [L435] m1 = p31_old [L436] p31_old = nomsg [L437] COND FALSE !(((int)m1) > ((int)max1)) [L442] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int)r1) == 1 [L445] COND TRUE ((int)max1) == ((int)id1) [L447] st1 = 1 [L449] mode1 = 0 [L451] _Bool node2__newmax; [L452] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=-128, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L453] COND TRUE !(mode2 == 0) [L455] r2 = (char)(((int)r2) + 1) [L456] COND TRUE !(ep12 == 0) [L458] m2 = p12_old [L459] p12_old = nomsg [L460] COND FALSE !(((int)m2) > ((int)max2)) [L465] COND FALSE !(!(ep32 == 0)) [L474] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L475] COND FALSE !(((int)r2) == 2) [L481] mode2 = 0 [L483] _Bool node3__newmax; [L484] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=0, max1=125, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L485] COND TRUE !(mode3 == 0) [L487] r3 = (char)(((int)r3) + 1) [L488] COND FALSE !(!(ep13 == 0)) [L497] COND TRUE !(ep23 == 0) [L499] m3 = p23_old [L500] p23_old = nomsg [L501] COND TRUE ((int)m3) > ((int)max3) [L503] max3 = m3 [L504] node3__newmax = 1 [L506] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L507] COND FALSE !(((int)r3) == 2) [L513] mode3 = 0 [L514] p12_old = p12_new [L515] p12_new = nomsg [L516] p13_old = p13_new [L517] p13_new = nomsg [L518] p21_old = p21_new [L519] p21_new = nomsg [L520] p23_old = p23_new [L521] p23_new = nomsg [L522] p31_old = p31_new [L523] p31_new = nomsg [L524] p32_old = p32_new [L525] p32_new = nomsg [L527] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L528] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L530] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L532] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L534] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L536] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L542] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1167] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L560] __return_1517 = check__tmp [L561] main__c1 = __return_1517 [L562] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L564] main____CPAchecker_TMP_0 = __tmp_1518_0 [L566] _Bool __tmp_2; [L567] __tmp_2 = main__c1 [L568] _Bool assert__arg; [L569] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L570] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L572] __VERIFIER_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=125, id2=127, id3=0, m1=0, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.52 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 30.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 1115.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 863.9 MB in the end (delta: 225.7 MB). Peak memory consumption was 225.7 MB. Max. memory is 11.5 GB. * CodeCheck took 494498.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 23.6 MB). Free memory was 863.9 MB in the beginning and 864.0 MB in the end (delta: -34.3 kB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. * Witness Printer took 111.14 ms. Allocated memory is still 1.2 GB. Free memory was 864.0 MB in the beginning and 824.4 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...