./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/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 dde90af2328c679905dbf72b0c2b57892228e614 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 16:25:23,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:25:23,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:25:23,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:25:23,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:25:23,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:25:23,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:25:23,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:25:23,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:25:23,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:25:23,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:25:23,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:25:23,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:25:23,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:25:23,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:25:23,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:25:23,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:25:23,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:25:23,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:25:23,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:25:23,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:25:23,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:25:23,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:25:23,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:25:23,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:25:23,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:25:23,402 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:25:23,403 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:25:23,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:25:23,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:25:23,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:25:23,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:25:23,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:25:23,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:25:23,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:25:23,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:25:23,406 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-01 16:25:23,416 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:25:23,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:25:23,417 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 16:25:23,417 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 16:25:23,417 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:25:23,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:25:23,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:25:23,418 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:25:23,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:25:23,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:25:23,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:25:23,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 16:25:23,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 16:25:23,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 16:25:23,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:25:23,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 16:25:23,419 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:25:23,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 16:25:23,419 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 16:25:23,419 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 16:25:23,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:25:23,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 16:25:23,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 16:25:23,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:25:23,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 16:25:23,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 16:25:23,420 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 16:25:23,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 16:25:23,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 16:25:23,420 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_ab57d65f-eb09-4077-baf3-0ee0bd40585c/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 -> dde90af2328c679905dbf72b0c2b57892228e614 [2018-12-01 16:25:23,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:25:23,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:25:23,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:25:23,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:25:23,455 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:25:23,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-12-01 16:25:23,496 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/data/2a48a0ee3/977d0028b94e4933ac92289c77003782/FLAGd3ec3d1f7 [2018-12-01 16:25:23,900 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:25:23,901 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.4.ufo.UNBOUNDED.pals.c [2018-12-01 16:25:23,905 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/data/2a48a0ee3/977d0028b94e4933ac92289c77003782/FLAGd3ec3d1f7 [2018-12-01 16:25:23,913 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/data/2a48a0ee3/977d0028b94e4933ac92289c77003782 [2018-12-01 16:25:23,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:25:23,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:25:23,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:25:23,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:25:23,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:25:23,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:25:23" (1/1) ... [2018-12-01 16:25:23,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc82c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:23, skipping insertion in model container [2018-12-01 16:25:23,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:25:23" (1/1) ... [2018-12-01 16:25:23,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:25:23,942 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:25:24,061 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:25:24,066 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:25:24,141 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:25:24,151 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:25:24,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24 WrapperNode [2018-12-01 16:25:24,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:25:24,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:25:24,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:25:24,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:25:24,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:25:24,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:25:24,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:25:24,180 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:25:24,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... [2018-12-01 16:25:24,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:25:24,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:25:24,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:25:24,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:25:24,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:25:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 16:25:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:25:24,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:25:25,569 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:25:25,569 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-01 16:25:25,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:25:25 BoogieIcfgContainer [2018-12-01 16:25:25,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:25:25,569 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 16:25:25,570 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 16:25:25,576 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 16:25:25,576 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:25:25" (1/1) ... [2018-12-01 16:25:25,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:25:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-01 16:25:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-01 16:25:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 16:25:25,604 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-01 16:25:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-01 16:25:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:25:25,887 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-01 16:25:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-01 16:25:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 16:25:26,135 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-01 16:25:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-01 16:25:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 16:25:26,426 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2018-12-01 16:25:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2018-12-01 16:25:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 16:25:26,926 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2018-12-01 16:25:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2018-12-01 16:25:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 16:25:27,672 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-01 16:25:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-01 16:25:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:25:28,638 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2018-12-01 16:25:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2018-12-01 16:25:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:25:28,833 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2018-12-01 16:25:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2018-12-01 16:25:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:25:28,862 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-12-01 16:25:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-12-01 16:25:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 16:25:30,931 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2018-12-01 16:25:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2018-12-01 16:25:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 16:25:31,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 74 states and 138 transitions. [2018-12-01 16:25:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 138 transitions. [2018-12-01 16:25:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 16:25:34,648 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:39,157 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-01 16:25:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 90 states and 170 transitions. [2018-12-01 16:25:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 170 transitions. [2018-12-01 16:25:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 16:25:40,097 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 107 states and 204 transitions. [2018-12-01 16:25:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 204 transitions. [2018-12-01 16:25:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 16:25:44,225 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 108 states and 208 transitions. [2018-12-01 16:25:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 208 transitions. [2018-12-01 16:25:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 16:25:44,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 109 states and 209 transitions. [2018-12-01 16:25:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 209 transitions. [2018-12-01 16:25:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 16:25:44,760 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 122 states and 234 transitions. [2018-12-01 16:25:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 234 transitions. [2018-12-01 16:25:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 16:25:51,561 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 124 states and 237 transitions. [2018-12-01 16:25:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 237 transitions. [2018-12-01 16:25:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 16:25:52,099 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 125 states and 242 transitions. [2018-12-01 16:25:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 242 transitions. [2018-12-01 16:25:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 16:25:52,496 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:25:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 126 states and 243 transitions. [2018-12-01 16:25:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 243 transitions. [2018-12-01 16:25:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 16:25:52,765 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:25:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:25:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:25:56,950 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-12-01 16:25:57,280 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-12-01 16:25:59,623 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-12-01 16:26:00,479 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-12-01 16:26:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 145 states and 277 transitions. [2018-12-01 16:26:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 277 transitions. [2018-12-01 16:26:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 16:26:04,813 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 150 states and 286 transitions. [2018-12-01 16:26:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 286 transitions. [2018-12-01 16:26:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 16:26:07,975 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 157 states and 304 transitions. [2018-12-01 16:26:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 304 transitions. [2018-12-01 16:26:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 16:26:18,041 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 170 states and 355 transitions. [2018-12-01 16:26:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 355 transitions. [2018-12-01 16:26:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:26:27,633 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 180 states and 385 transitions. [2018-12-01 16:26:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 385 transitions. [2018-12-01 16:26:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:26:35,685 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 183 states and 395 transitions. [2018-12-01 16:26:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 395 transitions. [2018-12-01 16:26:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:26:38,522 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 184 states and 396 transitions. [2018-12-01 16:26:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 396 transitions. [2018-12-01 16:26:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 16:26:39,224 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:50,237 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-12-01 16:26:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 198 states and 433 transitions. [2018-12-01 16:26:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 433 transitions. [2018-12-01 16:26:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 16:26:57,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:26:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:26:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:26:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 199 states and 436 transitions. [2018-12-01 16:26:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 436 transitions. [2018-12-01 16:26:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:26:58,407 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:26:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:07,595 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-01 16:27:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 213 states and 471 transitions. [2018-12-01 16:27:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 471 transitions. [2018-12-01 16:27:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:27:14,884 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 214 states and 476 transitions. [2018-12-01 16:27:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 476 transitions. [2018-12-01 16:27:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:27:15,740 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 216 states and 486 transitions. [2018-12-01 16:27:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 486 transitions. [2018-12-01 16:27:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 16:27:17,571 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:24,289 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-01 16:27:25,761 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-12-01 16:27:28,569 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-01 16:27:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 222 states and 505 transitions. [2018-12-01 16:27:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 505 transitions. [2018-12-01 16:27:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 16:27:33,180 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 225 states and 517 transitions. [2018-12-01 16:27:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 517 transitions. [2018-12-01 16:27:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 16:27:34,927 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:37,643 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-01 16:27:39,888 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-01 16:27:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 231 states and 533 transitions. [2018-12-01 16:27:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 533 transitions. [2018-12-01 16:27:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 16:27:46,150 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 234 states and 543 transitions. [2018-12-01 16:27:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 543 transitions. [2018-12-01 16:27:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 16:27:49,160 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 235 states and 549 transitions. [2018-12-01 16:27:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 549 transitions. [2018-12-01 16:27:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:27:51,062 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:27:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:27:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 240 states and 568 transitions. [2018-12-01 16:27:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 568 transitions. [2018-12-01 16:27:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:27:58,289 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:27:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:27:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:28:00,279 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-01 16:28:02,724 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-12-01 16:28:03,327 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-12-01 16:28:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:28:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 246 states and 584 transitions. [2018-12-01 16:28:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 584 transitions. [2018-12-01 16:28:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:28:07,061 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:28:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:28:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:28:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:28:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 249 states and 596 transitions. [2018-12-01 16:28:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 596 transitions. [2018-12-01 16:28:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 16:28:10,225 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:28:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:28:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:28:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:28:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:28:12,795 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 40 iterations. [2018-12-01 16:28:12,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 04:28:12 ImpRootNode [2018-12-01 16:28:12,893 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 16:28:12,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:28:12,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:28:12,894 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:28:12,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:25:25" (3/4) ... [2018-12-01 16:28:12,896 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 16:28:12,985 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ab57d65f-eb09-4077-baf3-0ee0bd40585c/bin-2019/ukojak/witness.graphml [2018-12-01 16:28:12,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:28:12,985 INFO L168 Benchmark]: Toolchain (without parser) took 169070.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 958.7 MB in the beginning and 730.0 MB in the end (delta: 228.7 MB). Peak memory consumption was 459.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:28:12,986 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:28:12,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-12-01 16:28:12,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.97 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:28:12,986 INFO L168 Benchmark]: Boogie Preprocessor took 20.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:28:12,986 INFO L168 Benchmark]: RCFGBuilder took 1369.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.1 MB). Peak memory consumption was 338.2 MB. Max. memory is 11.5 GB. [2018-12-01 16:28:12,986 INFO L168 Benchmark]: CodeCheck took 167323.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Free memory was 1.2 GB in the beginning and 755.2 MB in the end (delta: 440.5 MB). Peak memory consumption was 452.5 MB. Max. memory is 11.5 GB. [2018-12-01 16:28:12,987 INFO L168 Benchmark]: Witness Printer took 91.48 ms. Allocated memory is still 1.3 GB. Free memory was 755.2 MB in the beginning and 730.0 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-01 16:28:12,988 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, 134 locations, 1 error locations. UNSAFE Result, 167.2s OverallTime, 40 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 829870186 SDslu, 0 SDs, 0 SdLazy, -1946504926 SolverSat, -1741489800 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11156 GetRequests, 9686 SyntacticMatches, 528 SemanticMatches, 942 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563227 ImplicationChecksByTransitivity, 157.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 1032 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 948 ConstructedInterpolants, 0 QuantifiedInterpolants, 347048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 10 PerfectInterpolantSequences, 112/572 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: 610]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L532] int c1 ; [L533] int i2 ; [L536] c1 = 0 [L537] ep12 = __VERIFIER_nondet_bool() [L538] ep13 = __VERIFIER_nondet_bool() [L539] ep21 = __VERIFIER_nondet_bool() [L540] ep23 = __VERIFIER_nondet_bool() [L541] ep31 = __VERIFIER_nondet_bool() [L542] ep32 = __VERIFIER_nondet_bool() [L543] id1 = __VERIFIER_nondet_char() [L544] r1 = __VERIFIER_nondet_uchar() [L545] st1 = __VERIFIER_nondet_char() [L546] nl1 = __VERIFIER_nondet_char() [L547] m1 = __VERIFIER_nondet_char() [L548] max1 = __VERIFIER_nondet_char() [L549] mode1 = __VERIFIER_nondet_bool() [L550] id2 = __VERIFIER_nondet_char() [L551] r2 = __VERIFIER_nondet_uchar() [L552] st2 = __VERIFIER_nondet_char() [L553] nl2 = __VERIFIER_nondet_char() [L554] m2 = __VERIFIER_nondet_char() [L555] max2 = __VERIFIER_nondet_char() [L556] mode2 = __VERIFIER_nondet_bool() [L557] id3 = __VERIFIER_nondet_char() [L558] r3 = __VERIFIER_nondet_uchar() [L559] st3 = __VERIFIER_nondet_char() [L560] nl3 = __VERIFIER_nondet_char() [L561] m3 = __VERIFIER_nondet_char() [L562] max3 = __VERIFIER_nondet_char() [L563] mode3 = __VERIFIER_nondet_bool() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND FALSE !(\read(r121)) [L287] COND TRUE \read(r131) [L288] COND TRUE \read(ep32) [L289] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND TRUE \read(r131) [L298] tmp___0 = 1 [L309] r132 = (_Bool )tmp___0 [L310] COND TRUE \read(r211) [L311] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND FALSE !(\read(r231)) [L326] COND TRUE \read(r211) [L327] COND TRUE \read(ep13) [L328] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND TRUE \read(r311) [L337] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE \read(r122) [L372] COND TRUE \read(r132) [L373] COND TRUE \read(r212) [L374] COND TRUE \read(r232) [L375] COND TRUE \read(r312) [L376] COND TRUE \read(r322) [L377] COND TRUE (int )max1 == (int )id1 [L378] COND TRUE (int )max2 == (int )id2 [L379] COND TRUE (int )max3 == (int )id3 [L380] COND TRUE (int )st1 == 0 [L381] COND TRUE (int )st2 == 0 [L382] COND TRUE (int )st3 == 0 [L383] COND TRUE (int )nl1 == 0 [L384] COND TRUE (int )nl2 == 0 [L385] COND TRUE (int )nl3 == 0 [L386] COND TRUE (int )mode1 == 0 [L387] COND TRUE (int )mode2 == 0 [L388] COND TRUE (int )mode3 == 0 [L389] tmp___5 = 1 [L471] return (tmp___5); [L564] i2 = init() [L566] p12_old = nomsg [L567] p12_new = nomsg [L568] p13_old = nomsg [L569] p13_new = nomsg [L570] p21_old = nomsg [L571] p21_new = nomsg [L572] p23_old = nomsg [L573] p23_new = nomsg [L574] p31_old = nomsg [L575] p31_new = nomsg [L576] p32_old = nomsg [L577] p32_new = nomsg [L578] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 1 [L150] COND FALSE !(\read(ep12)) [L153] COND TRUE \read(ep13) [L154] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L154] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND FALSE !(\read(ep23)) [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] mode3 = (_Bool)1 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=4, m2=4, m3=2, max1=1, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = 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 [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND FALSE !((int )r1 == 2) [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND FALSE !((int )r2 == 2) [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND FALSE !(\read(ep23)) [L232] COND FALSE !((int )r3 == 2) [L239] mode3 = (_Bool)0 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND FALSE !((int )r1 < 1) [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND FALSE !(\read(ep23)) [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND TRUE \read(ep32) [L246] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] mode3 = (_Bool)1 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=1, max1=5, max2=5, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] nl1 = (char)1 [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND TRUE (int )r2 == 2 [L187] COND TRUE (int )max2 == (int )id2 [L188] st2 = (char)1 [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND FALSE !(\read(ep23)) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] mode3 = (_Bool)0 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L479] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L525] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L527] return (tmp); [L596] c1 = check() [L608] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L610] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=1, ep32=1, id1=1, id2=5, id3=3, m1=3, m2=3, m3=-1, max1=5, max2=5, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.97 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1369.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 92.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.1 MB). Peak memory consumption was 338.2 MB. Max. memory is 11.5 GB. * CodeCheck took 167323.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Free memory was 1.2 GB in the beginning and 755.2 MB in the end (delta: 440.5 MB). Peak memory consumption was 452.5 MB. Max. memory is 11.5 GB. * Witness Printer took 91.48 ms. Allocated memory is still 1.3 GB. Free memory was 755.2 MB in the beginning and 730.0 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...