./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.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_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/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 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 14:12:43,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:12:43,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:12:43,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:12:43,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:12:43,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:12:43,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:12:43,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:12:43,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:12:43,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:12:43,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:12:43,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:12:43,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:12:43,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:12:43,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:12:43,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:12:43,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:12:43,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:12:43,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:12:43,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:12:43,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:12:43,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:12:43,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:12:43,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:12:43,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:12:43,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:12:43,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:12:43,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:12:43,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:12:43,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:12:43,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:12:43,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:12:43,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:12:43,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:12:43,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:12:43,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:12:43,634 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 14:12:43,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:12:43,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:12:43,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:12:43,642 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 14:12:43,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:12:43,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:12:43,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:12:43,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:12:43,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:12:43,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:12:43,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:12:43,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:12:43,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:12:43,644 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:12:43,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:12:43,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:12:43,644 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:12:43,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:12:43,644 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 14:12:43,644 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 14:12:43,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:12:43,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:12:43,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 14:12:43,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:12:43,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:12:43,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:12:43,645 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 14:12:43,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:12:43,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:12:43,645 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_30bba54b-2a51-488f-823b-6adfa3e292ec/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 -> 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 [2018-12-02 14:12:43,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:12:43,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:12:43,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:12:43,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:12:43,673 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:12:43,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-02 14:12:43,711 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/data/beeb6dd28/ba8febdabd254e58aff68fe835fc61d3/FLAGc53c6746b [2018-12-02 14:12:44,123 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:12:44,124 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-12-02 14:12:44,129 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/data/beeb6dd28/ba8febdabd254e58aff68fe835fc61d3/FLAGc53c6746b [2018-12-02 14:12:44,137 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/data/beeb6dd28/ba8febdabd254e58aff68fe835fc61d3 [2018-12-02 14:12:44,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:12:44,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:12:44,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:12:44,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:12:44,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:12:44,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,144 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 02.12 02:12:44, skipping insertion in model container [2018-12-02 14:12:44,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:12:44,168 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:12:44,295 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:12:44,300 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:12:44,362 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:12:44,372 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:12:44,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44 WrapperNode [2018-12-02 14:12:44,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:12:44,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:12:44,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:12:44,373 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:12:44,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:12:44,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:12:44,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:12:44,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:12:44,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... [2018-12-02 14:12:44,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:12:44,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:12:44,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:12:44,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:12:44,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/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-02 14:12:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:12:44,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:12:45,876 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:12:45,876 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-02 14:12:45,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:45 BoogieIcfgContainer [2018-12-02 14:12:45,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:12:45,877 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 14:12:45,877 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 14:12:45,883 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 14:12:45,883 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:45" (1/1) ... [2018-12-02 14:12:45,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:12:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-02 14:12:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-02 14:12:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-02 14:12:45,913 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:46,148 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-02 14:12:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-02 14:12:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-02 14:12:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 14:12:46,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:46,307 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-02 14:12:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-02 14:12:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-02 14:12:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 14:12:46,481 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:46,572 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-02 14:12:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-02 14:12:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-02 14:12:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 14:12:46,844 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:46,926 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-02 14:12:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-02 14:12:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-02 14:12:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:12:47,275 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:47,396 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-02 14:12:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-02 14:12:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-02 14:12:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 14:12:47,963 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:48,058 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-02 14:12:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-02 14:12:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-02 14:12:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 14:12:48,803 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:48,859 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-02 14:12:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-02 14:12:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-02 14:12:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:12:49,015 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:49,034 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-02 14:12:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-02 14:12:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-02 14:12:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:12:49,044 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:49,190 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-02 14:12:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-02 14:12:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-02 14:12:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 14:12:50,439 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:50,547 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-02 14:12:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-02 14:12:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-02 14:12:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 14:12:50,687 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:51,334 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-02 14:12:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 77 states and 145 transitions. [2018-12-02 14:12:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 145 transitions. [2018-12-02 14:12:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:12:54,397 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:54,573 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-02 14:12:56,662 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-02 14:12:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 93 states and 180 transitions. [2018-12-02 14:12:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 180 transitions. [2018-12-02 14:12:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:12:59,484 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:12:59,533 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-02 14:12:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:12:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 94 states and 183 transitions. [2018-12-02 14:12:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 183 transitions. [2018-12-02 14:12:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:12:59,748 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:12:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:00,124 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-02 14:13:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 112 states and 223 transitions. [2018-12-02 14:13:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 223 transitions. [2018-12-02 14:13:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:13:06,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:06,719 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-02 14:13:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 113 states and 227 transitions. [2018-12-02 14:13:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 227 transitions. [2018-12-02 14:13:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:13:06,964 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:07,114 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-02 14:13:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 114 states and 229 transitions. [2018-12-02 14:13:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 229 transitions. [2018-12-02 14:13:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 14:13:07,333 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:07,692 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-02 14:13:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 133 states and 269 transitions. [2018-12-02 14:13:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 269 transitions. [2018-12-02 14:13:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 14:13:12,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:12,823 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-02 14:13:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 135 states and 272 transitions. [2018-12-02 14:13:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 272 transitions. [2018-12-02 14:13:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 14:13:13,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:13,424 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-02 14:13:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 136 states and 277 transitions. [2018-12-02 14:13:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 277 transitions. [2018-12-02 14:13:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:13:13,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:15,135 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-02 14:13:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 155 states and 313 transitions. [2018-12-02 14:13:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 313 transitions. [2018-12-02 14:13:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:13:22,664 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:22,746 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-02 14:13:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 158 states and 318 transitions. [2018-12-02 14:13:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 318 transitions. [2018-12-02 14:13:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:13:26,756 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:26,876 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-02 14:13:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 161 states and 327 transitions. [2018-12-02 14:13:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 327 transitions. [2018-12-02 14:13:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 14:13:29,181 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:29,844 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-02 14:13:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 181 states and 368 transitions. [2018-12-02 14:13:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 368 transitions. [2018-12-02 14:13:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 14:13:35,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:37,209 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-02 14:13:37,615 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-12-02 14:13:38,313 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-02 14:13:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 195 states and 389 transitions. [2018-12-02 14:13:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 389 transitions. [2018-12-02 14:13:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 14:13:43,846 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:44,006 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-02 14:13:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:13:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 200 states and 404 transitions. [2018-12-02 14:13:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 404 transitions. [2018-12-02 14:13:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 14:13:50,621 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:13:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:52,658 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-02 14:13:54,579 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2018-12-02 14:13:56,474 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 14:14:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 214 states and 463 transitions. [2018-12-02 14:14:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 463 transitions. [2018-12-02 14:14:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 14:14:03,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:03,592 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-02 14:14:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 219 states and 474 transitions. [2018-12-02 14:14:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 474 transitions. [2018-12-02 14:14:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 14:14:08,191 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:10,867 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-02 14:14:13,317 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-02 14:14:18,264 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-12-02 14:14:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 230 states and 492 transitions. [2018-12-02 14:14:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 492 transitions. [2018-12-02 14:14:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 14:14:22,720 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:22,794 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-02 14:14:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 233 states and 501 transitions. [2018-12-02 14:14:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 501 transitions. [2018-12-02 14:14:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 14:14:24,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:27,451 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-02 14:14:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 243 states and 518 transitions. [2018-12-02 14:14:33,406 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 518 transitions. [2018-12-02 14:14:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 14:14:33,407 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:33,454 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-02 14:14:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 245 states and 524 transitions. [2018-12-02 14:14:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 524 transitions. [2018-12-02 14:14:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 14:14:34,991 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:35,033 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-02 14:14:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 246 states and 527 transitions. [2018-12-02 14:14:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 527 transitions. [2018-12-02 14:14:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 14:14:35,560 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:36,809 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-02 14:14:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 261 states and 572 transitions. [2018-12-02 14:14:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 572 transitions. [2018-12-02 14:14:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 14:14:48,441 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:48,497 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-02 14:14:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 267 states and 589 transitions. [2018-12-02 14:14:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 589 transitions. [2018-12-02 14:14:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 14:14:51,051 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:51,095 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-02 14:14:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:14:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 269 states and 598 transitions. [2018-12-02 14:14:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 598 transitions. [2018-12-02 14:14:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 14:14:52,129 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:14:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:14:53,833 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-02 14:14:59,307 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-02 14:15:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 274 states and 617 transitions. [2018-12-02 14:15:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 617 transitions. [2018-12-02 14:15:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 14:15:03,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:03,220 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-02 14:15:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 275 states and 620 transitions. [2018-12-02 14:15:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 620 transitions. [2018-12-02 14:15:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 14:15:03,759 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:03,829 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-02 14:15:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 277 states and 631 transitions. [2018-12-02 14:15:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 631 transitions. [2018-12-02 14:15:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 14:15:05,419 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:05,633 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-02 14:15:08,892 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-12-02 14:15:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 281 states and 644 transitions. [2018-12-02 14:15:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 644 transitions. [2018-12-02 14:15:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 14:15:11,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:11,097 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-02 14:15:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 286 states and 659 transitions. [2018-12-02 14:15:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 659 transitions. [2018-12-02 14:15:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 14:15:15,398 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:15,439 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-02 14:15:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 290 states and 671 transitions. [2018-12-02 14:15:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 671 transitions. [2018-12-02 14:15:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 14:15:17,638 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:17,687 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-02 14:15:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 292 states and 681 transitions. [2018-12-02 14:15:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 681 transitions. [2018-12-02 14:15:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 14:15:19,652 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:20,129 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-02 14:15:22,501 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-02 14:15:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 296 states and 699 transitions. [2018-12-02 14:15:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 699 transitions. [2018-12-02 14:15:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 14:15:26,133 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:26,370 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-02 14:15:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 298 states and 702 transitions. [2018-12-02 14:15:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 702 transitions. [2018-12-02 14:15:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 14:15:27,730 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:27,982 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-02 14:15:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 301 states and 713 transitions. [2018-12-02 14:15:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 713 transitions. [2018-12-02 14:15:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 14:15:30,765 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:31,006 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-02 14:15:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 305 states and 725 transitions. [2018-12-02 14:15:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 725 transitions. [2018-12-02 14:15:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 14:15:34,620 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:15:34,904 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-02 14:15:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 14:15:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 306 states and 728 transitions. [2018-12-02 14:15:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 728 transitions. [2018-12-02 14:15:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 14:15:35,634 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 14:15:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:15:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:15:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:15:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:15:37,445 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2018-12-02 14:15:37,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 02:15:37 ImpRootNode [2018-12-02 14:15:37,535 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 14:15:37,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:15:37,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:15:37,536 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:15:37,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:45" (3/4) ... [2018-12-02 14:15:37,538 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:15:37,610 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_30bba54b-2a51-488f-823b-6adfa3e292ec/bin-2019/ukojak/witness.graphml [2018-12-02 14:15:37,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:15:37,611 INFO L168 Benchmark]: Toolchain (without parser) took 173472.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 264.2 MB). Free memory was 959.8 MB in the beginning and 765.0 MB in the end (delta: 194.7 MB). Peak memory consumption was 459.0 MB. Max. memory is 11.5 GB. [2018-12-02 14:15:37,611 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:15:37,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -203.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:15:37,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:15:37,612 INFO L168 Benchmark]: Boogie Preprocessor took 19.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:15:37,612 INFO L168 Benchmark]: RCFGBuilder took 1456.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.5 MB). Peak memory consumption was 318.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:15:37,612 INFO L168 Benchmark]: CodeCheck took 171658.34 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.1 MB). Free memory was 1.2 GB in the beginning and 788.5 MB in the end (delta: 365.9 MB). Peak memory consumption was 390.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:15:37,612 INFO L168 Benchmark]: Witness Printer took 74.85 ms. Allocated memory is still 1.3 GB. Free memory was 788.5 MB in the beginning and 765.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:15:37,613 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, 141 locations, 1 error locations. UNSAFE Result, 171.5s OverallTime, 48 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 717225948 SDtfs, -1881501098 SDslu, 1480622458 SDs, 0 SdLazy, 781739734 SolverSat, 1217447002 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14236 GetRequests, 12444 SyntacticMatches, 738 SemanticMatches, 1054 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686343 ImplicationChecksByTransitivity, 162.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1260 ConstructedInterpolants, 0 QuantifiedInterpolants, 481840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 147/781 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: 643]: 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}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] 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 TRUE \read(r121) [L302] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND FALSE !(\read(r131)) [L317] COND TRUE \read(r121) [L318] COND TRUE \read(ep23) [L319] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND FALSE !(\read(r211)) [L330] COND TRUE \read(r231) [L331] COND TRUE \read(ep31) [L332] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND TRUE \read(r231) [L341] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND TRUE \read(r311) [L354] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND FALSE !(\read(r321)) [L369] COND TRUE \read(r311) [L370] COND TRUE \read(ep12) [L371] 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 \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] return (tmp___5); [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 1 [L153] COND TRUE \read(ep12) [L154] COND TRUE \read(newmax1) [L155] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L155] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [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 TRUE \read(ep23) [L210] COND TRUE \read(newmax2) [L211] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L211] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [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 FALSE !(\read(ep32)) [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=1, m3=3, max1=0, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] 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 TRUE \read(ep12) [L178] m2 = p12_old [L179] p12_old = nomsg [L180] COND FALSE !((int )m2 > (int )max2) [L185] COND FALSE !(\read(ep32)) [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 TRUE \read(ep23) [L237] m3 = p23_old [L238] p23_old = nomsg [L239] COND FALSE !((int )m3 > (int )max3) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND FALSE !((int )r1 < 1) [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 TRUE \read(ep23) [L210] COND FALSE !(\read(newmax2)) [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 FALSE !(\read(ep32)) [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=3, m2=0, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] 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 TRUE \read(ep12) [L178] m2 = p12_old [L179] p12_old = nomsg [L180] COND FALSE !((int )m2 > (int )max2) [L185] COND FALSE !(\read(ep32)) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] 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 TRUE \read(ep23) [L237] m3 = p23_old [L238] p23_old = nomsg [L239] COND FALSE !((int )m3 > (int )max3) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L508] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L554] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L556] return (tmp); [L628] c1 = check() [L641] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L643] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=0, id2=2, id3=3, m1=-1, m2=-1, m3=-1, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 232.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -203.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1456.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.5 MB). Peak memory consumption was 318.7 MB. Max. memory is 11.5 GB. * CodeCheck took 171658.34 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.1 MB). Free memory was 1.2 GB in the beginning and 788.5 MB in the end (delta: 365.9 MB). Peak memory consumption was 390.1 MB. Max. memory is 11.5 GB. * Witness Printer took 74.85 ms. Allocated memory is still 1.3 GB. Free memory was 788.5 MB in the beginning and 765.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...