./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/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 b3efd85eaecafa9f5850339d4919cc79d62d9539 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:28:23,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:28:23,141 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:28:23,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:28:23,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:28:23,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:28:23,155 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:28:23,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:28:23,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:28:23,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:28:23,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:28:23,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:28:23,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:28:23,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:28:23,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:28:23,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:28:23,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:28:23,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:28:23,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:28:23,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:28:23,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:28:23,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:28:23,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:28:23,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:28:23,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:28:23,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:28:23,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:28:23,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:28:23,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:28:23,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:28:23,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:28:23,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:28:23,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:28:23,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:28:23,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:28:23,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:28:23,185 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 20:28:23,197 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:28:23,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:28:23,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:28:23,198 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:28:23,198 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:28:23,198 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:28:23,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:28:23,199 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:28:23,199 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:28:23,200 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:28:23,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:28:23,200 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:28:23,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:28:23,200 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:28:23,200 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:28:23,200 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:28:23,201 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:28:23,201 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 20:28:23,201 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 20:28:23,201 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:28:23,201 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:28:23,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 20:28:23,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:28:23,202 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:28:23,202 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:28:23,202 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 20:28:23,202 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:28:23,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:28:23,202 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_fa564495-1c6a-43ad-bf26-45e1b306a475/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 -> b3efd85eaecafa9f5850339d4919cc79d62d9539 [2018-10-26 20:28:23,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:28:23,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:28:23,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:28:23,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:28:23,253 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:28:23,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 20:28:23,298 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/data/95da6a77a/bbdb7fb9022b4b19815a825948502980/FLAG11fbdd718 [2018-10-26 20:28:23,711 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:28:23,712 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 20:28:23,721 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/data/95da6a77a/bbdb7fb9022b4b19815a825948502980/FLAG11fbdd718 [2018-10-26 20:28:23,737 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/data/95da6a77a/bbdb7fb9022b4b19815a825948502980 [2018-10-26 20:28:23,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:28:23,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:28:23,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:28:23,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:28:23,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:28:23,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:28:23" (1/1) ... [2018-10-26 20:28:23,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2815aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:23, skipping insertion in model container [2018-10-26 20:28:23,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:28:23" (1/1) ... [2018-10-26 20:28:23,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:28:23,809 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:28:24,033 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:28:24,040 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:28:24,088 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:28:24,102 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:28:24,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24 WrapperNode [2018-10-26 20:28:24,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:28:24,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:28:24,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:28:24,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:28:24,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:28:24,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:28:24,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:28:24,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:28:24,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... [2018-10-26 20:28:24,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:28:24,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:28:24,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:28:24,251 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:28:24,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 20:28:24,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:28:24,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:28:28,159 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:28:28,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:28:28 BoogieIcfgContainer [2018-10-26 20:28:28,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:28:28,161 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 20:28:28,161 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 20:28:28,169 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 20:28:28,169 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:28:28" (1/1) ... [2018-10-26 20:28:28,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 20:28:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 20:28:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 20:28:28,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:28,858 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:28:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-10-26 20:28:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-26 20:28:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 20:28:29,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-10-26 20:28:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-10-26 20:28:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 20:28:29,803 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-10-26 20:28:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-10-26 20:28:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 20:28:30,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-10-26 20:28:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-10-26 20:28:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 20:28:31,053 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-10-26 20:28:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-10-26 20:28:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 20:28:32,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-10-26 20:28:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-10-26 20:28:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 20:28:33,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-10-26 20:28:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-10-26 20:28:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 20:28:34,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-10-26 20:28:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-10-26 20:28:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 20:28:34,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 67 states and 113 transitions. [2018-10-26 20:28:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 113 transitions. [2018-10-26 20:28:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 20:28:36,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-10-26 20:28:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-10-26 20:28:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:28:37,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:38,336 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 20:28:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 88 states and 154 transitions. [2018-10-26 20:28:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-10-26 20:28:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:28:42,166 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:46,005 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-26 20:28:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 107 states and 188 transitions. [2018-10-26 20:28:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 188 transitions. [2018-10-26 20:28:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:28:47,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 121 states and 210 transitions. [2018-10-26 20:28:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 210 transitions. [2018-10-26 20:28:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:28:50,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 136 states and 234 transitions. [2018-10-26 20:28:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-10-26 20:28:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:28:54,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:28:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 139 states and 242 transitions. [2018-10-26 20:28:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 242 transitions. [2018-10-26 20:28:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 20:28:55,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:28:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 159 states and 274 transitions. [2018-10-26 20:29:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 274 transitions. [2018-10-26 20:29:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 20:29:01,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 163 states and 285 transitions. [2018-10-26 20:29:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 285 transitions. [2018-10-26 20:29:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 20:29:03,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 168 states and 295 transitions. [2018-10-26 20:29:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 295 transitions. [2018-10-26 20:29:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 20:29:05,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 172 states and 303 transitions. [2018-10-26 20:29:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 303 transitions. [2018-10-26 20:29:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:29:06,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 181 states and 322 transitions. [2018-10-26 20:29:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 322 transitions. [2018-10-26 20:29:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:29:11,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 184 states and 331 transitions. [2018-10-26 20:29:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 331 transitions. [2018-10-26 20:29:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:29:12,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 185 states and 332 transitions. [2018-10-26 20:29:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 332 transitions. [2018-10-26 20:29:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:29:13,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 198 states and 363 transitions. [2018-10-26 20:29:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 363 transitions. [2018-10-26 20:29:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:29:18,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 202 states and 374 transitions. [2018-10-26 20:29:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 374 transitions. [2018-10-26 20:29:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 20:29:20,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 204 states and 376 transitions. [2018-10-26 20:29:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 376 transitions. [2018-10-26 20:29:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 20:29:21,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 217 states and 399 transitions. [2018-10-26 20:29:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 399 transitions. [2018-10-26 20:29:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 20:29:28,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 216 states and 397 transitions. [2018-10-26 20:29:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 397 transitions. [2018-10-26 20:29:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 20:29:29,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 218 states and 400 transitions. [2018-10-26 20:29:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 400 transitions. [2018-10-26 20:29:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 20:29:30,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 219 states and 401 transitions. [2018-10-26 20:29:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 401 transitions. [2018-10-26 20:29:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:29:31,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 232 states and 426 transitions. [2018-10-26 20:29:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 426 transitions. [2018-10-26 20:29:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:29:40,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 234 states and 433 transitions. [2018-10-26 20:29:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 433 transitions. [2018-10-26 20:29:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:29:42,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 228 states and 426 transitions. [2018-10-26 20:29:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 426 transitions. [2018-10-26 20:29:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 20:29:44,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 240 states and 451 transitions. [2018-10-26 20:29:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 451 transitions. [2018-10-26 20:29:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 20:29:50,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 237 states and 449 transitions. [2018-10-26 20:29:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 449 transitions. [2018-10-26 20:29:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 20:29:52,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:53,269 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-10-26 20:29:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 239 states and 456 transitions. [2018-10-26 20:29:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 456 transitions. [2018-10-26 20:29:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:29:53,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:29:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:29:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 244 states and 470 transitions. [2018-10-26 20:29:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 470 transitions. [2018-10-26 20:29:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:29:59,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:29:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 248 states and 482 transitions. [2018-10-26 20:30:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 482 transitions. [2018-10-26 20:30:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:30:01,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 249 states and 483 transitions. [2018-10-26 20:30:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 483 transitions. [2018-10-26 20:30:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:30:02,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 253 states and 494 transitions. [2018-10-26 20:30:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 494 transitions. [2018-10-26 20:30:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 20:30:04,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 258 states and 506 transitions. [2018-10-26 20:30:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 506 transitions. [2018-10-26 20:30:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 20:30:06,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 263 states and 518 transitions. [2018-10-26 20:30:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 518 transitions. [2018-10-26 20:30:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 20:30:09,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 267 states and 527 transitions. [2018-10-26 20:30:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 527 transitions. [2018-10-26 20:30:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 20:30:10,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 269 states and 532 transitions. [2018-10-26 20:30:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 532 transitions. [2018-10-26 20:30:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:30:11,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 271 states and 539 transitions. [2018-10-26 20:30:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 539 transitions. [2018-10-26 20:30:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:30:13,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 273 states and 542 transitions. [2018-10-26 20:30:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 542 transitions. [2018-10-26 20:30:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:30:14,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 277 states and 553 transitions. [2018-10-26 20:30:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 553 transitions. [2018-10-26 20:30:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:30:16,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 278 states and 554 transitions. [2018-10-26 20:30:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 554 transitions. [2018-10-26 20:30:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:30:17,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 280 states and 556 transitions. [2018-10-26 20:30:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 556 transitions. [2018-10-26 20:30:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 20:30:18,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:30:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 20:30:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 284 states and 566 transitions. [2018-10-26 20:30:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 566 transitions. [2018-10-26 20:30:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 20:30:19,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 20:30:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:30:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:30:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:30:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:30:26,062 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 50 iterations. [2018-10-26 20:30:26,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 08:30:26 ImpRootNode [2018-10-26 20:30:26,194 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 20:30:26,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:30:26,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:30:26,195 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:30:26,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:28:28" (3/4) ... [2018-10-26 20:30:26,198 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:30:26,448 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa564495-1c6a-43ad-bf26-45e1b306a475/bin-2019/ukojak/witness.graphml [2018-10-26 20:30:26,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:30:26,450 INFO L168 Benchmark]: Toolchain (without parser) took 122706.92 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 962.4 MB in the beginning and 1.3 GB in the end (delta: -386.7 MB). Peak memory consumption was 961.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:30:26,451 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:30:26,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.00 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 940.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:30:26,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -206.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:30:26,452 INFO L168 Benchmark]: Boogie Preprocessor took 31.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:30:26,452 INFO L168 Benchmark]: RCFGBuilder took 3909.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.5 MB). Peak memory consumption was 265.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:30:26,454 INFO L168 Benchmark]: CodeCheck took 118033.59 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -293.1 MB). Peak memory consumption was 904.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:30:26,454 INFO L168 Benchmark]: Witness Printer took 254.44 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:30:26,456 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, 130 locations, 1 error locations. UNSAFE Result, 117.8s OverallTime, 50 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -2110267540 SDtfs, 1020371104 SDslu, -1414887580 SDs, 0 SdLazy, -684742012 SolverSat, 1629221580 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15310 GetRequests, 13447 SyntacticMatches, 947 SemanticMatches, 916 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555394 ImplicationChecksByTransitivity, 101.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 1600 NumberOfCodeBlocks, 1600 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1499 ConstructedInterpolants, 0 QuantifiedInterpolants, 609892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 10 PerfectInterpolantSequences, 190/1002 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: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L554] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND TRUE \read(r121) [L291] COND TRUE \read(ep23) [L292] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND TRUE \read(r231) [L314] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND TRUE \read(r311) [L343] COND TRUE \read(ep12) [L344] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] RET return (tmp___5); [L554] EXPR init() [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 1 [L146] COND TRUE \read(ep12) [L147] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=5, m2=4, m3=127, max1=2, max2=3, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND TRUE (int )m1 > (int )max1 [L126] max1 = m1 [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND TRUE (int )m1 > (int )max1 [L133] max1 = m1 [L136] COND FALSE !((int )r1 == 2) [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND FALSE !((int )r1 < 1) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=2, m3=3, max1=4, max2=3, max3=4, mode1=1, mode2=1, mode3=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=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] nl1 = (char)1 [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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] [L601] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=3, id3=4, m1=4, m2=-1, m3=3, max1=4, max2=3, max3=4, mode1=0, mode2=0, mode3=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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.00 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 940.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -206.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3909.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.5 MB). Peak memory consumption was 265.4 MB. Max. memory is 11.5 GB. * CodeCheck took 118033.59 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -293.1 MB). Peak memory consumption was 904.3 MB. Max. memory is 11.5 GB. * Witness Printer took 254.44 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...