./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/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 c8186bb9e195ec2f40116dc473c413c4e1a34c0f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 11:47:05,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:47:05,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:47:05,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:47:05,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:47:05,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:47:05,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:47:05,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:47:05,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:47:05,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:47:05,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:47:05,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:47:05,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:47:05,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:47:05,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:47:05,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:47:05,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:47:05,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:47:05,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:47:05,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:47:05,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:47:05,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:47:05,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:47:05,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:47:05,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:47:05,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:47:05,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:47:05,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:47:05,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:47:05,407 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:47:05,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:47:05,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:47:05,408 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:47:05,408 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:47:05,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:47:05,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:47:05,409 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 11:47:05,416 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:47:05,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:47:05,416 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:47:05,416 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:47:05,417 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:47:05,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:47:05,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:47:05,417 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:47:05,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:47:05,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:47:05,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:47:05,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:47:05,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:47:05,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:47:05,418 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:47:05,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:47:05,418 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:47:05,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:47:05,418 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 11:47:05,418 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 11:47:05,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:47:05,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:47:05,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 11:47:05,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:47:05,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:47:05,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:47:05,419 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 11:47:05,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:47:05,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:47:05,419 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_f55e4256-1825-48c4-b005-21a5c5a3a1cf/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 -> c8186bb9e195ec2f40116dc473c413c4e1a34c0f [2018-11-18 11:47:05,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:47:05,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:47:05,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:47:05,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:47:05,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:47:05,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 11:47:05,490 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/data/00e4d5247/c0855331513a452ba3751db683a24b89/FLAGd0f841672 [2018-11-18 11:47:05,916 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:47:05,916 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 11:47:05,922 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/data/00e4d5247/c0855331513a452ba3751db683a24b89/FLAGd0f841672 [2018-11-18 11:47:05,931 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/data/00e4d5247/c0855331513a452ba3751db683a24b89 [2018-11-18 11:47:05,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:47:05,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:47:05,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:47:05,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:47:05,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:47:05,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:47:05" (1/1) ... [2018-11-18 11:47:05,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c3b532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:05, skipping insertion in model container [2018-11-18 11:47:05,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:47:05" (1/1) ... [2018-11-18 11:47:05,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:47:05,977 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:47:06,129 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:47:06,137 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:47:06,214 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:47:06,227 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:47:06,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06 WrapperNode [2018-11-18 11:47:06,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:47:06,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:47:06,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:47:06,229 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:47:06,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:47:06,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:47:06,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:47:06,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:47:06,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... [2018-11-18 11:47:06,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:47:06,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:47:06,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:47:06,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:47:06,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:47:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/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-11-18 11:47:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:47:06,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:47:08,398 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:47:08,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:47:08 BoogieIcfgContainer [2018-11-18 11:47:08,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:47:08,400 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 11:47:08,400 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 11:47:08,409 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 11:47:08,409 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:47:08" (1/1) ... [2018-11-18 11:47:08,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:47:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 11:47:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 11:47:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 11:47:08,449 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-18 11:47:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-18 11:47:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 11:47:08,902 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-18 11:47:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-18 11:47:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 11:47:09,227 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-18 11:47:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-18 11:47:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 11:47:09,628 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-18 11:47:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-18 11:47:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 11:47:10,276 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-18 11:47:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-18 11:47:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 11:47:10,955 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-18 11:47:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-18 11:47:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 11:47:11,693 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-18 11:47:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-18 11:47:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 11:47:11,885 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-18 11:47:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-18 11:47:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 11:47:11,913 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 67 states and 114 transitions. [2018-11-18 11:47:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2018-11-18 11:47:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 11:47:13,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 70 states and 120 transitions. [2018-11-18 11:47:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 120 transitions. [2018-11-18 11:47:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:47:13,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 88 states and 154 transitions. [2018-11-18 11:47:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-11-18 11:47:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:47:16,223 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 103 states and 177 transitions. [2018-11-18 11:47:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 177 transitions. [2018-11-18 11:47:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:47:18,287 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 123 states and 212 transitions. [2018-11-18 11:47:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 212 transitions. [2018-11-18 11:47:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:47:21,305 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 131 states and 229 transitions. [2018-11-18 11:47:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 229 transitions. [2018-11-18 11:47:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:47:24,592 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 135 states and 237 transitions. [2018-11-18 11:47:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2018-11-18 11:47:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:47:27,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 139 states and 245 transitions. [2018-11-18 11:47:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 245 transitions. [2018-11-18 11:47:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:47:28,636 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 144 states and 254 transitions. [2018-11-18 11:47:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2018-11-18 11:47:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:47:29,861 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 148 states and 261 transitions. [2018-11-18 11:47:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 261 transitions. [2018-11-18 11:47:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:47:30,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 172 states and 300 transitions. [2018-11-18 11:47:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 300 transitions. [2018-11-18 11:47:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:47:37,179 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 176 states and 310 transitions. [2018-11-18 11:47:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 310 transitions. [2018-11-18 11:47:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:47:38,353 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 177 states and 311 transitions. [2018-11-18 11:47:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-18 11:47:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:47:38,898 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 11:47:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 177 states and 303 transitions. [2018-11-18 11:47:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 303 transitions. [2018-11-18 11:47:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 11:47:39,437 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 192 states and 366 transitions. [2018-11-18 11:47:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 366 transitions. [2018-11-18 11:47:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 11:47:45,618 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 200 states and 379 transitions. [2018-11-18 11:47:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 379 transitions. [2018-11-18 11:47:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 11:47:47,777 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 201 states and 380 transitions. [2018-11-18 11:47:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 380 transitions. [2018-11-18 11:47:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 11:47:48,647 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 202 states and 381 transitions. [2018-11-18 11:47:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 381 transitions. [2018-11-18 11:47:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 11:47:49,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 213 states and 400 transitions. [2018-11-18 11:47:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 400 transitions. [2018-11-18 11:47:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 11:47:54,081 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 222 states and 413 transitions. [2018-11-18 11:47:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 413 transitions. [2018-11-18 11:47:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 11:47:56,801 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 227 states and 433 transitions. [2018-11-18 11:47:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 433 transitions. [2018-11-18 11:47:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 11:47:58,651 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 228 states and 434 transitions. [2018-11-18 11:47:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 434 transitions. [2018-11-18 11:47:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 11:47:59,262 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:47:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:47:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:47:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:47:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 230 states and 453 transitions. [2018-11-18 11:47:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 453 transitions. [2018-11-18 11:47:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:47:59,978 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 243 states and 486 transitions. [2018-11-18 11:48:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 486 transitions. [2018-11-18 11:48:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:48:05,981 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 254 states and 505 transitions. [2018-11-18 11:48:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 505 transitions. [2018-11-18 11:48:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:48:09,259 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 259 states and 518 transitions. [2018-11-18 11:48:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 518 transitions. [2018-11-18 11:48:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:48:11,240 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 269 states and 541 transitions. [2018-11-18 11:48:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 541 transitions. [2018-11-18 11:48:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:48:16,638 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 269 states and 550 transitions. [2018-11-18 11:48:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 550 transitions. [2018-11-18 11:48:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:48:18,591 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 278 states and 568 transitions. [2018-11-18 11:48:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 568 transitions. [2018-11-18 11:48:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:48:21,421 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 273 states and 562 transitions. [2018-11-18 11:48:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 562 transitions. [2018-11-18 11:48:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:48:21,931 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 279 states and 577 transitions. [2018-11-18 11:48:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 577 transitions. [2018-11-18 11:48:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:48:26,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 284 states and 591 transitions. [2018-11-18 11:48:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 591 transitions. [2018-11-18 11:48:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:48:28,827 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 283 states and 589 transitions. [2018-11-18 11:48:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 589 transitions. [2018-11-18 11:48:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 11:48:29,308 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 287 states and 601 transitions. [2018-11-18 11:48:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 601 transitions. [2018-11-18 11:48:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:48:30,669 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 295 states and 621 transitions. [2018-11-18 11:48:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 621 transitions. [2018-11-18 11:48:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:48:33,788 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 297 states and 624 transitions. [2018-11-18 11:48:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 624 transitions. [2018-11-18 11:48:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:48:34,349 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 299 states and 630 transitions. [2018-11-18 11:48:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 630 transitions. [2018-11-18 11:48:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 11:48:34,959 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 303 states and 641 transitions. [2018-11-18 11:48:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 641 transitions. [2018-11-18 11:48:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:48:36,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 309 states and 662 transitions. [2018-11-18 11:48:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 662 transitions. [2018-11-18 11:48:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:48:40,210 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 311 states and 663 transitions. [2018-11-18 11:48:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 663 transitions. [2018-11-18 11:48:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:48:41,793 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 315 states and 675 transitions. [2018-11-18 11:48:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 675 transitions. [2018-11-18 11:48:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:48:43,393 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 317 states and 679 transitions. [2018-11-18 11:48:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 679 transitions. [2018-11-18 11:48:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:48:44,340 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:48:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:48:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 11:48:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 319 states and 682 transitions. [2018-11-18 11:48:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 682 transitions. [2018-11-18 11:48:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 11:48:45,299 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 11:48:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:48:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:48:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:48:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:48:46,561 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 52 iterations. [2018-11-18 11:48:46,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 11:48:46 ImpRootNode [2018-11-18 11:48:46,661 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 11:48:46,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:48:46,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:48:46,661 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:48:46,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:47:08" (3/4) ... [2018-11-18 11:48:46,665 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 11:48:46,752 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f55e4256-1825-48c4-b005-21a5c5a3a1cf/bin-2019/ukojak/witness.graphml [2018-11-18 11:48:46,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:48:46,752 INFO L168 Benchmark]: Toolchain (without parser) took 100818.93 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -298.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 11:48:46,753 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:48:46,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:48:46,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.66 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-11-18 11:48:46,756 INFO L168 Benchmark]: Boogie Preprocessor took 26.09 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-11-18 11:48:46,756 INFO L168 Benchmark]: RCFGBuilder took 2107.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.8 MB). Peak memory consumption was 261.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:48:46,756 INFO L168 Benchmark]: CodeCheck took 98261.07 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -274.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 11:48:46,756 INFO L168 Benchmark]: Witness Printer took 91.02 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:48:46,758 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, 142 locations, 1 error locations. UNSAFE Result, 98.1s OverallTime, 52 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1096773596 SDtfs, 1707497212 SDslu, 1352706676 SDs, 0 SdLazy, -60593136 SolverSat, -370687336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16095 GetRequests, 14153 SyntacticMatches, 935 SemanticMatches, 1007 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627957 ImplicationChecksByTransitivity, 89.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 1676 NumberOfCodeBlocks, 1676 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1573 ConstructedInterpolants, 0 QuantifiedInterpolants, 621983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 10 PerfectInterpolantSequences, 211/1050 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] newmax3 = __VERIFIER_nondet_bool() [L596] CALL, EXPR init() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND TRUE \read(r121) [L302] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND TRUE \read(r131) [L315] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND TRUE \read(r211) [L328] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND TRUE \read(r211) [L344] COND TRUE \read(ep13) [L345] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND FALSE !(\read(r311)) [L356] COND TRUE \read(r321) [L357] COND TRUE \read(ep21) [L358] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] RET return (tmp___5); [L596] EXPR init() [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND TRUE \read(ep12) [L154] COND TRUE \read(newmax1) [L155] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L155] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] RET mode1 = (_Bool)1 [L613] node1() [L614] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] RET mode2 = (_Bool)1 [L614] node2() [L615] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] RET mode3 = (_Bool)1 [L615] node3() [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L629] assert(c1) [L630] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=2, m2=1, m3=127, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] RET mode1 = (_Bool)0 [L613] node1() [L614] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND TRUE \read(ep12) [L178] m2 = p12_old [L179] p12_old = nomsg [L180] COND TRUE (int )m2 > (int )max2 [L181] max2 = m2 [L182] newmax = (_Bool)1 [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND TRUE (int )m2 > (int )max2 [L189] max2 = m2 [L190] newmax = (_Bool)1 [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] RET mode2 = (_Bool)0 [L614] node2() [L615] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] RET mode3 = (_Bool)0 [L615] node3() [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L556] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L629] assert(c1) [L630] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND TRUE \read(ep12) [L154] COND FALSE !(\read(newmax1)) [L158] COND TRUE \read(ep13) [L159] COND FALSE !(\read(newmax1)) [L164] RET mode1 = (_Bool)1 [L613] node1() [L614] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] RET mode2 = (_Bool)1 [L614] node2() [L615] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] RET mode3 = (_Bool)1 [L615] node3() [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L556] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, 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] [L629] assert(c1) [L630] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=0, m2=4, m3=1, max1=1, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L131] newmax = (_Bool)1 [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND FALSE !((int )max1 == (int )id1) [L147] st1 = (char)1 [L150] RET mode1 = (_Bool)0 [L613] node1() [L614] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND TRUE \read(ep12) [L178] m2 = p12_old [L179] p12_old = nomsg [L180] COND FALSE !((int )m2 > (int )max2) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND FALSE !((int )max2 == (int )id2) [L198] nl2 = (char)1 [L201] RET mode2 = (_Bool)0 [L614] node2() [L615] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] RET mode3 = (_Bool)0 [L615] node3() [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=4, m2=-1, m3=-1, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] [L508] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L554] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=4, m2=-1, m3=-1, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] [L556] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=4, m2=-1, m3=-1, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] [L643] __VERIFIER_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=0, id3=4, m1=4, m2=-1, m3=-1, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.66 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. * Boogie Preprocessor took 26.09 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 2107.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.8 MB). Peak memory consumption was 261.5 MB. Max. memory is 11.5 GB. * CodeCheck took 98261.07 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -274.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 91.02 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...