./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/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_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/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-635dfa2 [2018-12-03 01:10:16,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:10:16,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:10:16,866 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:10:16,866 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:10:16,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:10:16,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:10:16,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:10:16,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:10:16,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:10:16,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:10:16,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:10:16,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:10:16,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:10:16,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:10:16,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:10:16,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:10:16,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:10:16,873 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:10:16,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:10:16,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:10:16,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:10:16,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:10:16,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:10:16,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:10:16,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:10:16,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:10:16,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:10:16,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:10:16,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:10:16,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:10:16,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:10:16,879 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:10:16,879 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:10:16,879 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:10:16,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:10:16,880 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-03 01:10:16,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:10:16,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:10:16,887 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:10:16,888 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-03 01:10:16,888 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:10:16,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:10:16,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:10:16,888 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:10:16,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:10:16,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:10:16,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:10:16,889 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-03 01:10:16,889 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-03 01:10:16,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:10:16,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:10:16,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-03 01:10:16,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:10:16,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:10:16,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:10:16,890 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-03 01:10:16,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:10:16,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:10:16,890 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_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/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-12-03 01:10:16,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:10:16,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:10:16,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:10:16,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:10:16,921 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:10:16,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-03 01:10:16,963 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/data/e80ac62b3/d8f02a15119b49b783e75426e96069de/FLAG18a09306d [2018-12-03 01:10:17,362 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:10:17,362 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-03 01:10:17,367 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/data/e80ac62b3/d8f02a15119b49b783e75426e96069de/FLAG18a09306d [2018-12-03 01:10:17,375 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/data/e80ac62b3/d8f02a15119b49b783e75426e96069de [2018-12-03 01:10:17,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:10:17,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:10:17,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:10:17,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:10:17,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:10:17,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc82c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17, skipping insertion in model container [2018-12-03 01:10:17,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:10:17,405 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:10:17,526 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:10:17,531 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:10:17,604 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:10:17,617 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:10:17,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17 WrapperNode [2018-12-03 01:10:17,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:10:17,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:10:17,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:10:17,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:10:17,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:10:17,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:10:17,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:10:17,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:10:17,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... [2018-12-03 01:10:17,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:10:17,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:10:17,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:10:17,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:10:17,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/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-12-03 01:10:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:10:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:10:18,974 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:10:18,975 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-03 01:10:18,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:18 BoogieIcfgContainer [2018-12-03 01:10:18,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:10:18,975 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-03 01:10:18,975 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-03 01:10:18,982 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-03 01:10:18,982 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:18" (1/1) ... [2018-12-03 01:10:18,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-03 01:10:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-03 01:10:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 01:10:19,016 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-03 01:10:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-03 01:10:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 01:10:19,371 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-03 01:10:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-03 01:10:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 01:10:19,649 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-03 01:10:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-03 01:10:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 01:10:20,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-03 01:10:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-03 01:10:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 01:10:20,546 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-03 01:10:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-03 01:10:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 01:10:21,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-03 01:10:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-03 01:10:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 01:10:22,367 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-03 01:10:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-03 01:10:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 01:10:22,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-03 01:10:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-03 01:10:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 01:10:22,592 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 58 states and 105 transitions. [2018-12-03 01:10:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-12-03 01:10:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 01:10:24,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 61 states and 111 transitions. [2018-12-03 01:10:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2018-12-03 01:10:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:10:24,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 77 states and 144 transitions. [2018-12-03 01:10:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2018-12-03 01:10:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:10:27,378 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 91 states and 168 transitions. [2018-12-03 01:10:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 168 transitions. [2018-12-03 01:10:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 01:10:30,359 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 92 states and 170 transitions. [2018-12-03 01:10:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 170 transitions. [2018-12-03 01:10:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 01:10:30,627 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 106 states and 196 transitions. [2018-12-03 01:10:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 196 transitions. [2018-12-03 01:10:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 01:10:34,866 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 108 states and 201 transitions. [2018-12-03 01:10:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 201 transitions. [2018-12-03 01:10:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 01:10:35,424 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:43,167 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-03 01:10:43,475 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-03 01:10:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 127 states and 241 transitions. [2018-12-03 01:10:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 241 transitions. [2018-12-03 01:10:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 01:10:45,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 130 states and 249 transitions. [2018-12-03 01:10:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 249 transitions. [2018-12-03 01:10:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 01:10:45,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 131 states and 252 transitions. [2018-12-03 01:10:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 252 transitions. [2018-12-03 01:10:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 01:10:46,429 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:49,826 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-03 01:10:50,232 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-12-03 01:10:50,645 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-03 01:10:52,956 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-03 01:10:53,373 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-03 01:10:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 150 states and 285 transitions. [2018-12-03 01:10:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 285 transitions. [2018-12-03 01:10:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 01:10:56,885 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 154 states and 295 transitions. [2018-12-03 01:10:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 295 transitions. [2018-12-03 01:10:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 01:10:58,274 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:10:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 159 states and 304 transitions. [2018-12-03 01:10:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 304 transitions. [2018-12-03 01:10:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 01:10:59,561 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:10:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 163 states and 311 transitions. [2018-12-03 01:11:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 311 transitions. [2018-12-03 01:11:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 01:11:01,750 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:04,287 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-03 01:11:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 182 states and 345 transitions. [2018-12-03 01:11:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 345 transitions. [2018-12-03 01:11:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 01:11:10,082 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:11,279 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-12-03 01:11:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 186 states and 355 transitions. [2018-12-03 01:11:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 355 transitions. [2018-12-03 01:11:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 01:11:13,622 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:17,835 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-12-03 01:11:20,717 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-03 01:11:21,400 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-03 01:11:23,156 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-03 01:11:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 210 states and 430 transitions. [2018-12-03 01:11:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 430 transitions. [2018-12-03 01:11:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 01:11:35,880 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 214 states and 439 transitions. [2018-12-03 01:11:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 439 transitions. [2018-12-03 01:11:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 01:11:37,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 215 states and 440 transitions. [2018-12-03 01:11:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 440 transitions. [2018-12-03 01:11:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:11:38,398 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 226 states and 460 transitions. [2018-12-03 01:11:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 460 transitions. [2018-12-03 01:11:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:11:47,421 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:11:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:11:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 228 states and 462 transitions. [2018-12-03 01:11:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 462 transitions. [2018-12-03 01:11:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 01:11:48,612 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:11:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:11:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 241 states and 494 transitions. [2018-12-03 01:12:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 494 transitions. [2018-12-03 01:12:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 01:12:05,174 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 247 states and 507 transitions. [2018-12-03 01:12:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 507 transitions. [2018-12-03 01:12:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 01:12:09,544 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 249 states and 515 transitions. [2018-12-03 01:12:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 515 transitions. [2018-12-03 01:12:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 01:12:10,551 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:17,193 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-03 01:12:21,763 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-12-03 01:12:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 258 states and 537 transitions. [2018-12-03 01:12:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 537 transitions. [2018-12-03 01:12:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 01:12:27,150 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 257 states and 542 transitions. [2018-12-03 01:12:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 542 transitions. [2018-12-03 01:12:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 01:12:29,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 258 states and 545 transitions. [2018-12-03 01:12:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 545 transitions. [2018-12-03 01:12:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 01:12:30,617 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:38,333 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-12-03 01:12:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 262 states and 555 transitions. [2018-12-03 01:12:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 555 transitions. [2018-12-03 01:12:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 01:12:39,423 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 263 states and 560 transitions. [2018-12-03 01:12:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 560 transitions. [2018-12-03 01:12:40,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 01:12:40,253 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 267 states and 576 transitions. [2018-12-03 01:12:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 576 transitions. [2018-12-03 01:12:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 01:12:46,637 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 270 states and 588 transitions. [2018-12-03 01:12:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 588 transitions. [2018-12-03 01:12:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:12:48,482 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 274 states and 601 transitions. [2018-12-03 01:12:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 601 transitions. [2018-12-03 01:12:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:12:50,773 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 278 states and 612 transitions. [2018-12-03 01:12:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 612 transitions. [2018-12-03 01:12:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:12:53,303 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 281 states and 621 transitions. [2018-12-03 01:12:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 621 transitions. [2018-12-03 01:12:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 01:12:56,031 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:12:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:12:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 282 states and 625 transitions. [2018-12-03 01:12:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 625 transitions. [2018-12-03 01:12:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 01:12:56,764 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:12:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:12:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:13:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:13:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 294 states and 655 transitions. [2018-12-03 01:13:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 655 transitions. [2018-12-03 01:13:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 01:13:14,390 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:13:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:13:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:13:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:13:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 297 states and 659 transitions. [2018-12-03 01:13:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 659 transitions. [2018-12-03 01:13:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 01:13:18,486 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:13:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:13:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:13:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:13:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 301 states and 672 transitions. [2018-12-03 01:13:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 672 transitions. [2018-12-03 01:13:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 01:13:24,437 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:13:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:13:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:13:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:13:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 302 states and 674 transitions. [2018-12-03 01:13:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 674 transitions. [2018-12-03 01:13:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 01:13:25,387 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:13:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:13:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 01:13:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-03 01:13:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 301 states and 657 transitions. [2018-12-03 01:13:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 657 transitions. [2018-12-03 01:13:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 01:13:26,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-03 01:13:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:13:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:13:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:13:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:13:27,170 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2018-12-03 01:13:27,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 01:13:27 ImpRootNode [2018-12-03 01:13:27,274 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-03 01:13:27,274 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:13:27,274 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:13:27,275 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:13:27,275 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:18" (3/4) ... [2018-12-03 01:13:27,277 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 01:13:27,375 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3334baab-b0a8-46cb-ac0f-778f34e6ae0b/bin-2019/ukojak/witness.graphml [2018-12-03 01:13:27,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:13:27,375 INFO L168 Benchmark]: Toolchain (without parser) took 189998.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.0 MB). Free memory was 953.3 MB in the beginning and 757.9 MB in the end (delta: 195.4 MB). Peak memory consumption was 422.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:13:27,376 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:13:27,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:13:27,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:13:27,376 INFO L168 Benchmark]: Boogie Preprocessor took 19.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:13:27,376 INFO L168 Benchmark]: RCFGBuilder took 1308.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.8 MB). Peak memory consumption was 261.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:13:27,377 INFO L168 Benchmark]: CodeCheck took 188298.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 779.9 MB in the end (delta: 234.4 MB). Peak memory consumption was 352.9 MB. Max. memory is 11.5 GB. [2018-12-03 01:13:27,377 INFO L168 Benchmark]: Witness Printer took 100.66 ms. Allocated memory is still 1.3 GB. Free memory was 779.9 MB in the beginning and 757.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-12-03 01:13:27,378 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, 135 locations, 1 error locations. UNSAFE Result, 188.1s OverallTime, 49 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1938833416 SDtfs, -1499204942 SDslu, 753348016 SDs, 0 SdLazy, 566496098 SolverSat, -995104776 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14639 GetRequests, 12874 SyntacticMatches, 737 SemanticMatches, 1028 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655231 ImplicationChecksByTransitivity, 178.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1408 NumberOfCodeBlocks, 1408 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 416687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 183/831 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: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [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 ; [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() [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 TRUE \read(r321) [L367] tmp___4 = 1 [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] return (tmp___5); [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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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 [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] mode1 = (_Bool)1 [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] mode2 = (_Bool)1 [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] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L257] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [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 [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, 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=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=1, m2=4, m3=2, max1=0, max2=3, max3=2, 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=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [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] mode1 = (_Bool)0 [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 TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [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] mode3 = (_Bool)0 [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 [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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 [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] mode1 = (_Bool)1 [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] mode2 = (_Bool)1 [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 TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] mode3 = (_Bool)1 [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 [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=2, m2=2, m3=2, max1=2, max2=3, max3=2, 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 [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] mode1 = (_Bool)0 [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 TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] mode2 = (_Bool)0 [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] mode3 = (_Bool)0 [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 [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=-1, m2=-1, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=-1, m2=-1, m3=2, max1=2, max2=3, max3=2, 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] return (tmp); [L604] c1 = check() [L617] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=0, id2=3, id3=2, m1=-1, m2=-1, m3=2, max1=2, max2=3, max3=2, 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=1, id1=0, id2=3, id3=2, m1=-1, m2=-1, m3=2, max1=2, max2=3, max3=2, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1308.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.8 MB). Peak memory consumption was 261.5 MB. Max. memory is 11.5 GB. * CodeCheck took 188298.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 779.9 MB in the end (delta: 234.4 MB). Peak memory consumption was 352.9 MB. Max. memory is 11.5 GB. * Witness Printer took 100.66 ms. Allocated memory is still 1.3 GB. Free memory was 779.9 MB in the beginning and 757.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...