./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/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 64424a1c8c8e4b1dfa6f86e97492679716532609 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.23-1dbac8b [2018-10-26 21:01:47,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:01:47,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:01:47,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:01:47,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:01:47,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:01:47,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:01:47,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:01:47,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:01:47,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:01:47,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:01:47,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:01:47,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:01:47,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:01:47,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:01:47,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:01:47,616 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:01:47,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:01:47,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:01:47,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:01:47,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:01:47,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:01:47,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:01:47,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:01:47,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:01:47,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:01:47,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:01:47,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:01:47,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:01:47,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:01:47,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:01:47,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:01:47,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:01:47,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:01:47,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:01:47,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:01:47,637 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 21:01:47,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:01:47,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:01:47,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:01:47,650 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:01:47,650 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:01:47,650 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:01:47,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:01:47,651 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:01:47,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:01:47,651 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:01:47,651 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:01:47,651 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:01:47,651 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:01:47,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:01:47,652 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:01:47,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:01:47,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:01:47,652 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 21:01:47,652 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 21:01:47,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:01:47,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:01:47,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:01:47,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:01:47,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:01:47,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:01:47,655 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 21:01:47,656 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:01:47,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:01:47,656 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/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 -> 64424a1c8c8e4b1dfa6f86e97492679716532609 [2018-10-26 21:01:47,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:01:47,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:01:47,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:01:47,705 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:01:47,705 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:01:47,705 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 21:01:47,751 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/data/90ddf8cad/72768eb1f90847eeb94c0a062acb917a/FLAG58ce78f49 [2018-10-26 21:01:48,160 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:01:48,161 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 21:01:48,170 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/data/90ddf8cad/72768eb1f90847eeb94c0a062acb917a/FLAG58ce78f49 [2018-10-26 21:01:48,183 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/data/90ddf8cad/72768eb1f90847eeb94c0a062acb917a [2018-10-26 21:01:48,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:01:48,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:01:48,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:01:48,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:01:48,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:01:48,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d51faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48, skipping insertion in model container [2018-10-26 21:01:48,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:01:48,235 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:01:48,419 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:01:48,426 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:01:48,478 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:01:48,499 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:01:48,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48 WrapperNode [2018-10-26 21:01:48,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:01:48,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:01:48,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:01:48,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:01:48,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:01:48,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:01:48,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:01:48,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:01:48,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... [2018-10-26 21:01:48,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:01:48,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:01:48,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:01:48,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:01:48,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:01:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/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 [2018-10-26 21:01:48,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:01:48,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:01:52,845 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:01:52,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:01:52 BoogieIcfgContainer [2018-10-26 21:01:52,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:01:52,846 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 21:01:52,846 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 21:01:52,854 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 21:01:52,855 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:01:52" (1/1) ... [2018-10-26 21:01:52,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:01:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 21:01:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 21:01:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 21:01:52,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-10-26 21:01:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-26 21:01:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 21:01:53,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-10-26 21:01:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-10-26 21:01:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 21:01:54,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:54,718 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 21:01:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-10-26 21:01:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-10-26 21:01:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 21:01:55,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-10-26 21:01:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-10-26 21:01:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 21:01:56,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-10-26 21:01:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-10-26 21:01:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:01:57,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-10-26 21:01:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-10-26 21:01:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:01:58,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-10-26 21:01:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-10-26 21:01:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:01:59,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:01:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:01:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-10-26 21:01:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-10-26 21:01:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:01:59,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:01:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:01:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 67 states and 114 transitions. [2018-10-26 21:02:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2018-10-26 21:02:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 21:02:01,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 70 states and 120 transitions. [2018-10-26 21:02:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 120 transitions. [2018-10-26 21:02:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:02:02,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:03,242 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-26 21:02:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:05,475 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 21:02:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 88 states and 152 transitions. [2018-10-26 21:02:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-10-26 21:02:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:02:08,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:10,066 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-10-26 21:02:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 102 states and 174 transitions. [2018-10-26 21:02:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 174 transitions. [2018-10-26 21:02:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:02:12,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 103 states and 176 transitions. [2018-10-26 21:02:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 176 transitions. [2018-10-26 21:02:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:02:13,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:16,344 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-10-26 21:02:16,716 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-10-26 21:02:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 117 states and 200 transitions. [2018-10-26 21:02:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 200 transitions. [2018-10-26 21:02:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:02:17,915 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 119 states and 204 transitions. [2018-10-26 21:02:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 204 transitions. [2018-10-26 21:02:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:02:19,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 120 states and 205 transitions. [2018-10-26 21:02:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 205 transitions. [2018-10-26 21:02:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:02:19,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 141 states and 244 transitions. [2018-10-26 21:02:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 244 transitions. [2018-10-26 21:02:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:02:25,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 144 states and 251 transitions. [2018-10-26 21:02:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 251 transitions. [2018-10-26 21:02:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:02:26,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 146 states and 256 transitions. [2018-10-26 21:02:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 256 transitions. [2018-10-26 21:02:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:02:27,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 157 states and 279 transitions. [2018-10-26 21:02:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2018-10-26 21:02:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:02:32,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 161 states and 288 transitions. [2018-10-26 21:02:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 288 transitions. [2018-10-26 21:02:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:02:34,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 164 states and 295 transitions. [2018-10-26 21:02:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 295 transitions. [2018-10-26 21:02:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:02:36,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 166 states and 300 transitions. [2018-10-26 21:02:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 300 transitions. [2018-10-26 21:02:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:02:38,236 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 171 states and 311 transitions. [2018-10-26 21:02:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 311 transitions. [2018-10-26 21:02:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:02:40,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 173 states and 314 transitions. [2018-10-26 21:02:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 314 transitions. [2018-10-26 21:02:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:02:41,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 174 states and 315 transitions. [2018-10-26 21:02:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 315 transitions. [2018-10-26 21:02:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:02:42,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 176 states and 318 transitions. [2018-10-26 21:02:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 318 transitions. [2018-10-26 21:02:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:02:43,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 178 states and 321 transitions. [2018-10-26 21:02:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 321 transitions. [2018-10-26 21:02:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:02:44,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 180 states and 324 transitions. [2018-10-26 21:02:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 324 transitions. [2018-10-26 21:02:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:02:45,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 191 states and 347 transitions. [2018-10-26 21:02:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 347 transitions. [2018-10-26 21:02:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:02:52,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 195 states and 354 transitions. [2018-10-26 21:02:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 354 transitions. [2018-10-26 21:02:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:02:54,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 197 states and 359 transitions. [2018-10-26 21:02:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 359 transitions. [2018-10-26 21:02:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:02:56,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 198 states and 360 transitions. [2018-10-26 21:02:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 360 transitions. [2018-10-26 21:02:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:02:57,629 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:02:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 200 states and 364 transitions. [2018-10-26 21:02:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 364 transitions. [2018-10-26 21:02:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:02:59,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:02:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 215 states and 428 transitions. [2018-10-26 21:03:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 428 transitions. [2018-10-26 21:03:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:03:07,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:08,885 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-26 21:03:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 217 states and 430 transitions. [2018-10-26 21:03:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 430 transitions. [2018-10-26 21:03:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:03:09,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 218 states and 431 transitions. [2018-10-26 21:03:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 431 transitions. [2018-10-26 21:03:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:03:10,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 221 states and 435 transitions. [2018-10-26 21:03:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 435 transitions. [2018-10-26 21:03:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:03:11,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 224 states and 439 transitions. [2018-10-26 21:03:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 439 transitions. [2018-10-26 21:03:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:03:12,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 227 states and 443 transitions. [2018-10-26 21:03:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 443 transitions. [2018-10-26 21:03:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:03:14,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 238 states and 468 transitions. [2018-10-26 21:03:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 468 transitions. [2018-10-26 21:03:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:03:21,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 241 states and 471 transitions. [2018-10-26 21:03:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 471 transitions. [2018-10-26 21:03:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:03:22,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 242 states and 472 transitions. [2018-10-26 21:03:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 472 transitions. [2018-10-26 21:03:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:03:24,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 241 states and 470 transitions. [2018-10-26 21:03:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 470 transitions. [2018-10-26 21:03:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:03:25,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 235 states and 463 transitions. [2018-10-26 21:03:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 463 transitions. [2018-10-26 21:03:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:03:26,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 246 states and 488 transitions. [2018-10-26 21:03:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 488 transitions. [2018-10-26 21:03:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:03:34,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 248 states and 490 transitions. [2018-10-26 21:03:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 490 transitions. [2018-10-26 21:03:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:03:36,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:37,266 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-10-26 21:03:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 250 states and 497 transitions. [2018-10-26 21:03:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 497 transitions. [2018-10-26 21:03:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:03:38,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 245 states and 491 transitions. [2018-10-26 21:03:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 491 transitions. [2018-10-26 21:03:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:39,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 260 states and 529 transitions. [2018-10-26 21:03:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 529 transitions. [2018-10-26 21:03:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:48,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 263 states and 537 transitions. [2018-10-26 21:03:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 537 transitions. [2018-10-26 21:03:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:50,506 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 265 states and 544 transitions. [2018-10-26 21:03:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 544 transitions. [2018-10-26 21:03:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:51,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 270 states and 555 transitions. [2018-10-26 21:03:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 555 transitions. [2018-10-26 21:03:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:54,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 271 states and 557 transitions. [2018-10-26 21:03:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 557 transitions. [2018-10-26 21:03:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:55,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 272 states and 558 transitions. [2018-10-26 21:03:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 558 transitions. [2018-10-26 21:03:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:56,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 273 states and 559 transitions. [2018-10-26 21:03:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 559 transitions. [2018-10-26 21:03:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:57,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 275 states and 561 transitions. [2018-10-26 21:03:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 561 transitions. [2018-10-26 21:03:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:03:58,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:03:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:03:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:03:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 277 states and 563 transitions. [2018-10-26 21:03:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 563 transitions. [2018-10-26 21:03:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:03:59,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:03:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 281 states and 573 transitions. [2018-10-26 21:04:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 573 transitions. [2018-10-26 21:04:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:04:06,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 283 states and 579 transitions. [2018-10-26 21:04:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 579 transitions. [2018-10-26 21:04:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:04:07,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 285 states and 585 transitions. [2018-10-26 21:04:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 585 transitions. [2018-10-26 21:04:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:04:09,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 287 states and 591 transitions. [2018-10-26 21:04:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 591 transitions. [2018-10-26 21:04:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:04:10,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 292 states and 602 transitions. [2018-10-26 21:04:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 602 transitions. [2018-10-26 21:04:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:04:14,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 294 states and 608 transitions. [2018-10-26 21:04:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 608 transitions. [2018-10-26 21:04:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:04:16,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 296 states and 611 transitions. [2018-10-26 21:04:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 611 transitions. [2018-10-26 21:04:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:04:17,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 298 states and 614 transitions. [2018-10-26 21:04:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 614 transitions. [2018-10-26 21:04:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:04:18,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 306 states and 630 transitions. [2018-10-26 21:04:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 630 transitions. [2018-10-26 21:04:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:04:25,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 310 states and 637 transitions. [2018-10-26 21:04:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 637 transitions. [2018-10-26 21:04:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:04:28,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 313 states and 641 transitions. [2018-10-26 21:04:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 641 transitions. [2018-10-26 21:04:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:04:29,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 318 states and 655 transitions. [2018-10-26 21:04:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 655 transitions. [2018-10-26 21:04:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:04:32,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:04:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 322 states and 668 transitions. [2018-10-26 21:04:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 668 transitions. [2018-10-26 21:04:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 21:04:34,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:04:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 21:04:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:04:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 321 states and 652 transitions. [2018-10-26 21:04:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 652 transitions. [2018-10-26 21:04:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 21:04:36,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:04:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:04:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:04:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:04:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:04:37,485 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 73 iterations. [2018-10-26 21:04:37,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 09:04:37 ImpRootNode [2018-10-26 21:04:37,615 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 21:04:37,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:04:37,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:04:37,616 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:04:37,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:01:52" (3/4) ... [2018-10-26 21:04:37,620 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:04:37,832 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_353be5a2-a166-4ff8-915f-33b7f58e7b0e/bin-2019/ukojak/witness.graphml [2018-10-26 21:04:37,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:04:37,832 INFO L168 Benchmark]: Toolchain (without parser) took 169646.32 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 954.4 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 400.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:04:37,833 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:04:37,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 934.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:04:37,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 934.3 MB in the beginning and 1.2 GB in the end (delta: -217.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:04:37,835 INFO L168 Benchmark]: Boogie Preprocessor took 30.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:04:37,835 INFO L168 Benchmark]: RCFGBuilder took 4198.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.5 MB). Peak memory consumption was 265.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:04:37,835 INFO L168 Benchmark]: CodeCheck took 164769.14 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 337.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:04:37,835 INFO L168 Benchmark]: Witness Printer took 215.96 ms. Allocated memory is still 2.7 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:04:37,837 INFO L336 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, 136 locations, 1 error locations. UNSAFE Result, 164.6s OverallTime, 73 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 499154808 SDtfs, 379842118 SDslu, -528140928 SDs, 0 SdLazy, 297610536 SolverSat, 1946373714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 173.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23385 GetRequests, 20919 SyntacticMatches, 1420 SemanticMatches, 1046 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702891 ImplicationChecksByTransitivity, 147.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 38.7s InterpolantComputationTime, 2351 NumberOfCodeBlocks, 2351 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 2227 ConstructedInterpolants, 0 QuantifiedInterpolants, 774031 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 72 InterpolantComputations, 10 PerfectInterpolantSequences, 300/1435 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 619]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L537] int c1 ; [L538] int i2 ; [L541] c1 = 0 [L542] ep12 = __VERIFIER_nondet_bool() [L543] ep13 = __VERIFIER_nondet_bool() [L544] ep21 = __VERIFIER_nondet_bool() [L545] ep23 = __VERIFIER_nondet_bool() [L546] ep31 = __VERIFIER_nondet_bool() [L547] ep32 = __VERIFIER_nondet_bool() [L548] id1 = __VERIFIER_nondet_char() [L549] r1 = __VERIFIER_nondet_char() [L550] st1 = __VERIFIER_nondet_char() [L551] nl1 = __VERIFIER_nondet_char() [L552] m1 = __VERIFIER_nondet_char() [L553] max1 = __VERIFIER_nondet_char() [L554] mode1 = __VERIFIER_nondet_bool() [L555] newmax1 = __VERIFIER_nondet_bool() [L556] id2 = __VERIFIER_nondet_char() [L557] r2 = __VERIFIER_nondet_char() [L558] st2 = __VERIFIER_nondet_char() [L559] nl2 = __VERIFIER_nondet_char() [L560] m2 = __VERIFIER_nondet_char() [L561] max2 = __VERIFIER_nondet_char() [L562] mode2 = __VERIFIER_nondet_bool() [L563] newmax2 = __VERIFIER_nondet_bool() [L564] id3 = __VERIFIER_nondet_char() [L565] r3 = __VERIFIER_nondet_char() [L566] st3 = __VERIFIER_nondet_char() [L567] nl3 = __VERIFIER_nondet_char() [L568] m3 = __VERIFIER_nondet_char() [L569] max3 = __VERIFIER_nondet_char() [L570] mode3 = __VERIFIER_nondet_bool() [L571] newmax3 = __VERIFIER_nondet_bool() [L572] CALL, EXPR init() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND FALSE !(\read(r131)) [L311] tmp = 0 [L313] r122 = (_Bool )tmp [L314] COND FALSE !(\read(r131)) [L317] COND FALSE !(\read(r121)) [L324] tmp___0 = 0 [L326] r132 = (_Bool )tmp___0 [L327] COND FALSE !(\read(r211)) [L330] COND FALSE !(\read(r231)) [L337] tmp___1 = 0 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND FALSE !(\read(r211)) [L350] tmp___2 = 0 [L352] r232 = (_Bool )tmp___2 [L353] COND TRUE \read(r311) [L354] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND FALSE !(\read(r321)) [L369] COND TRUE \read(r311) [L370] COND FALSE !(\read(ep12)) [L373] tmp___4 = 0 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE (int )max1 == (int )id1 [L389] COND TRUE (int )max2 == (int )id2 [L390] COND TRUE (int )max3 == (int )id3 [L391] COND TRUE (int )st1 == 0 [L392] COND TRUE (int )st2 == 0 [L393] COND TRUE (int )st3 == 0 [L394] COND TRUE (int )nl1 == 0 [L395] COND TRUE (int )nl2 == 0 [L396] COND TRUE (int )nl3 == 0 [L397] COND TRUE (int )mode1 == 0 [L398] COND TRUE (int )mode2 == 0 [L399] COND TRUE (int )mode3 == 0 [L400] COND TRUE \read(newmax1) [L401] COND TRUE \read(newmax2) [L402] COND TRUE \read(newmax3) [L403] tmp___5 = 1 [L476] RET return (tmp___5); [L572] EXPR init() [L572] i2 = init() [L574] p12_old = nomsg [L575] p12_new = nomsg [L576] p13_old = nomsg [L577] p13_new = nomsg [L578] p21_old = nomsg [L579] p21_new = nomsg [L580] p23_old = nomsg [L581] p23_new = nomsg [L582] p31_old = nomsg [L583] p31_new = nomsg [L584] p32_old = nomsg [L585] p32_new = nomsg [L586] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, 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] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND FALSE !(\read(ep13)) [L164] RET mode1 = (_Bool)1 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] RET mode2 = (_Bool)1 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND TRUE \read(ep31) [L256] COND TRUE \read(newmax3) [L257] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L257] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L260] COND FALSE !(\read(ep32)) [L266] RET mode3 = (_Bool)1 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L605] assert(c1) [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=4, m2=0, m3=-2, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND TRUE \read(ep31) [L135] m1 = p31_old [L136] p31_old = nomsg [L137] COND TRUE (int )m1 > (int )max1 [L138] max1 = m1 [L139] newmax = (_Bool)1 [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] RET mode1 = (_Bool)0 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND FALSE !(\read(ep32)) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] RET mode2 = (_Bool)0 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] RET mode3 = (_Bool)0 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L605] assert(c1) [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND FALSE !(\read(ep13)) [L164] RET mode1 = (_Bool)1 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] RET mode2 = (_Bool)1 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND TRUE \read(ep31) [L256] COND FALSE !(\read(newmax3)) [L260] COND FALSE !(\read(ep32)) [L266] RET mode3 = (_Bool)1 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L605] assert(c1) [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=3, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND TRUE \read(ep31) [L135] m1 = p31_old [L136] p31_old = nomsg [L137] COND FALSE !((int )m1 > (int )max1) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND FALSE !((int )max1 == (int )id1) [L147] nl1 = (char)1 [L150] RET mode1 = (_Bool)0 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND FALSE !(\read(ep32)) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] RET mode2 = (_Bool)0 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] RET mode3 = (_Bool)0 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=-1, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L484] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L530] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=-1, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=-1, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L619] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=1, id3=3, m1=-1, m2=0, m3=-2, max1=3, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 934.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 934.3 MB in the beginning and 1.2 GB in the end (delta: -217.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4198.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.5 MB). Peak memory consumption was 265.7 MB. Max. memory is 11.5 GB. * CodeCheck took 164769.14 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 337.5 MB. Max. memory is 11.5 GB. * Witness Printer took 215.96 ms. Allocated memory is still 2.7 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...