./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/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 b21da786d95e06bc319c05bb1d8697b6b032c077 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 03:05:13,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:05:13,414 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:05:13,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:05:13,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:05:13,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:05:13,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:05:13,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:05:13,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:05:13,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:05:13,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:05:13,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:05:13,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:05:13,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:05:13,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:05:13,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:05:13,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:05:13,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:05:13,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:05:13,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:05:13,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:05:13,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:05:13,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:05:13,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:05:13,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:05:13,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:05:13,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:05:13,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:05:13,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:05:13,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:05:13,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:05:13,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:05:13,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:05:13,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:05:13,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:05:13,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:05:13,444 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 03:05:13,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:05:13,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:05:13,455 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:05:13,455 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 03:05:13,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:05:13,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:05:13,456 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:05:13,457 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:05:13,457 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:05:13,457 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:05:13,457 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 03:05:13,457 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 03:05:13,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:05:13,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:05:13,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 03:05:13,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:05:13,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:05:13,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:05:13,458 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 03:05:13,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:05:13,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:05:13,458 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_283b2990-ef19-4d01-a796-612952e62e08/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 -> b21da786d95e06bc319c05bb1d8697b6b032c077 [2018-12-02 03:05:13,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:05:13,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:05:13,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:05:13,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:05:13,490 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:05:13,490 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-02 03:05:13,524 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/data/43382aaf5/c4031cbe9a55475e8ea2feabea1dd332/FLAG7d5ba7cf6 [2018-12-02 03:05:13,850 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:05:13,850 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-02 03:05:13,856 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/data/43382aaf5/c4031cbe9a55475e8ea2feabea1dd332/FLAG7d5ba7cf6 [2018-12-02 03:05:14,250 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/data/43382aaf5/c4031cbe9a55475e8ea2feabea1dd332 [2018-12-02 03:05:14,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:05:14,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:05:14,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:05:14,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:05:14,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:05:14,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4215f226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14, skipping insertion in model container [2018-12-02 03:05:14,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:05:14,283 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:05:14,401 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:05:14,407 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:05:14,439 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:05:14,484 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:05:14,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14 WrapperNode [2018-12-02 03:05:14,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:05:14,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:05:14,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:05:14,485 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:05:14,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:05:14,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:05:14,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:05:14,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:05:14,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... [2018-12-02 03:05:14,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:05:14,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:05:14,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:05:14,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:05:14,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:05:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 03:05:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:05:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:05:15,867 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:05:15,867 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-02 03:05:15,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:05:15 BoogieIcfgContainer [2018-12-02 03:05:15,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:05:15,868 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 03:05:15,868 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 03:05:15,874 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 03:05:15,874 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:05:15" (1/1) ... [2018-12-02 03:05:15,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:05:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-02 03:05:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-02 03:05:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-02 03:05:15,907 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-02 03:05:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-02 03:05:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 03:05:16,188 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-02 03:05:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-02 03:05:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 03:05:16,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-02 03:05:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-02 03:05:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 03:05:16,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:16,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-02 03:05:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-02 03:05:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-02 03:05:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 03:05:17,189 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-02 03:05:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-02 03:05:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 03:05:17,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-02 03:05:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-02 03:05:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 03:05:18,524 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-02 03:05:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-02 03:05:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 03:05:18,709 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-02 03:05:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-02 03:05:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 03:05:18,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-02 03:05:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-02 03:05:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 03:05:20,236 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-02 03:05:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-02 03:05:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 03:05:20,539 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 77 states and 145 transitions. [2018-12-02 03:05:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 145 transitions. [2018-12-02 03:05:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 03:05:24,391 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 94 states and 182 transitions. [2018-12-02 03:05:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 182 transitions. [2018-12-02 03:05:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 03:05:28,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 95 states and 185 transitions. [2018-12-02 03:05:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 185 transitions. [2018-12-02 03:05:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 03:05:28,586 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 113 states and 225 transitions. [2018-12-02 03:05:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 225 transitions. [2018-12-02 03:05:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 03:05:35,198 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 114 states and 226 transitions. [2018-12-02 03:05:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 226 transitions. [2018-12-02 03:05:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 03:05:35,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 115 states and 230 transitions. [2018-12-02 03:05:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 230 transitions. [2018-12-02 03:05:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 03:05:35,755 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 129 states and 262 transitions. [2018-12-02 03:05:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 262 transitions. [2018-12-02 03:05:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 03:05:41,066 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 132 states and 269 transitions. [2018-12-02 03:05:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 269 transitions. [2018-12-02 03:05:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 03:05:42,111 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 133 states and 270 transitions. [2018-12-02 03:05:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 270 transitions. [2018-12-02 03:05:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 03:05:42,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 152 states and 309 transitions. [2018-12-02 03:05:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 309 transitions. [2018-12-02 03:05:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 03:05:50,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 153 states and 313 transitions. [2018-12-02 03:05:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 313 transitions. [2018-12-02 03:05:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 03:05:51,106 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 156 states and 318 transitions. [2018-12-02 03:05:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 318 transitions. [2018-12-02 03:05:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 03:05:52,365 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 158 states and 321 transitions. [2018-12-02 03:05:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 321 transitions. [2018-12-02 03:05:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 03:05:53,069 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:05:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:05:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 160 states and 325 transitions. [2018-12-02 03:05:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 325 transitions. [2018-12-02 03:05:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 03:05:54,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:05:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:05:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 180 states and 366 transitions. [2018-12-02 03:06:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 366 transitions. [2018-12-02 03:06:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 03:06:02,431 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 183 states and 375 transitions. [2018-12-02 03:06:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 375 transitions. [2018-12-02 03:06:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 03:06:07,135 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 188 states and 388 transitions. [2018-12-02 03:06:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 388 transitions. [2018-12-02 03:06:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 03:06:09,776 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 202 states and 444 transitions. [2018-12-02 03:06:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 444 transitions. [2018-12-02 03:06:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 03:06:19,715 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 207 states and 454 transitions. [2018-12-02 03:06:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 454 transitions. [2018-12-02 03:06:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 03:06:22,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 221 states and 493 transitions. [2018-12-02 03:06:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 493 transitions. [2018-12-02 03:06:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 03:06:31,559 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 226 states and 500 transitions. [2018-12-02 03:06:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 500 transitions. [2018-12-02 03:06:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 03:06:33,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 241 states and 537 transitions. [2018-12-02 03:06:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 537 transitions. [2018-12-02 03:06:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 03:06:42,394 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 247 states and 559 transitions. [2018-12-02 03:06:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 559 transitions. [2018-12-02 03:06:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 03:06:44,781 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 257 states and 585 transitions. [2018-12-02 03:06:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 585 transitions. [2018-12-02 03:06:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 03:06:53,855 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 254 states and 592 transitions. [2018-12-02 03:06:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 592 transitions. [2018-12-02 03:06:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 03:06:56,539 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:06:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:06:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 255 states and 593 transitions. [2018-12-02 03:06:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 593 transitions. [2018-12-02 03:06:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 03:06:57,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:06:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:06:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 270 states and 635 transitions. [2018-12-02 03:07:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 635 transitions. [2018-12-02 03:07:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 03:07:12,420 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 277 states and 659 transitions. [2018-12-02 03:07:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 659 transitions. [2018-12-02 03:07:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 03:07:15,971 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 284 states and 683 transitions. [2018-12-02 03:07:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 683 transitions. [2018-12-02 03:07:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 03:07:25,665 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 289 states and 701 transitions. [2018-12-02 03:07:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 701 transitions. [2018-12-02 03:07:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 03:07:29,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 290 states and 707 transitions. [2018-12-02 03:07:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 707 transitions. [2018-12-02 03:07:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 03:07:30,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 292 states and 713 transitions. [2018-12-02 03:07:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 713 transitions. [2018-12-02 03:07:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 03:07:40,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 297 states and 732 transitions. [2018-12-02 03:07:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 732 transitions. [2018-12-02 03:07:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 03:07:44,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 298 states and 737 transitions. [2018-12-02 03:07:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 737 transitions. [2018-12-02 03:07:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 03:07:46,044 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:07:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:07:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 03:07:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 302 states and 753 transitions. [2018-12-02 03:07:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 753 transitions. [2018-12-02 03:07:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 03:07:48,799 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 03:07:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:07:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:07:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:07:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:07:50,005 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 46 iterations. [2018-12-02 03:07:50,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 03:07:50 ImpRootNode [2018-12-02 03:07:50,091 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 03:07:50,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:07:50,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:07:50,091 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:07:50,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:05:15" (3/4) ... [2018-12-02 03:07:50,093 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 03:07:50,168 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_283b2990-ef19-4d01-a796-612952e62e08/bin-2019/ukojak/witness.graphml [2018-12-02 03:07:50,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:07:50,169 INFO L168 Benchmark]: Toolchain (without parser) took 155916.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 961.4 MB in the beginning and 934.2 MB in the end (delta: 27.1 MB). Peak memory consumption was 253.1 MB. Max. memory is 11.5 GB. [2018-12-02 03:07:50,170 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:07:50,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:07:50,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:07:50,170 INFO L168 Benchmark]: Boogie Preprocessor took 20.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:07:50,171 INFO L168 Benchmark]: RCFGBuilder took 1325.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 749.5 MB in the end (delta: 331.7 MB). Peak memory consumption was 331.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:07:50,171 INFO L168 Benchmark]: CodeCheck took 154222.69 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 135.3 MB). Free memory was 749.5 MB in the beginning and 961.6 MB in the end (delta: -212.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:07:50,171 INFO L168 Benchmark]: Witness Printer took 77.35 ms. Allocated memory is still 1.3 GB. Free memory was 961.6 MB in the beginning and 934.2 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-12-02 03:07:50,172 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, 129 locations, 1 error locations. UNSAFE Result, 154.1s OverallTime, 46 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1219166172 SDtfs, 993771836 SDslu, -1853577172 SDs, 0 SdLazy, -1528090364 SolverSat, -300621128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12963 GetRequests, 11241 SyntacticMatches, 688 SemanticMatches, 1034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664495 ImplicationChecksByTransitivity, 146.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1155 ConstructedInterpolants, 0 QuantifiedInterpolants, 456285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 10 PerfectInterpolantSequences, 122/671 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND TRUE \read(r131) [L288] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND TRUE \read(r211) [L317] COND TRUE \read(ep13) [L318] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND TRUE \read(r311) [L343] COND TRUE \read(ep12) [L344] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] return (tmp___5); [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND TRUE \read(ep13) [L150] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=4, m2=0, m3=3, max1=1, max2=2, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND TRUE (int )m1 > (int )max1 [L126] max1 = m1 [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND TRUE (int )m1 > (int )max1 [L133] max1 = m1 [L136] COND FALSE !((int )r1 == 2) [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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 [L489] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L588] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, 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] [L569] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND TRUE \read(ep13) [L150] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] mode2 = (_Bool)1 [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] mode3 = (_Bool)1 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] return (tmp); [L586] c1 = check() [L599] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L588] i2 ++ VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=1, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] st1 = (char)1 [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND TRUE (int )m2 > (int )max2 [L169] max2 = m2 [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND FALSE !((int )max2 == (int )id2) [L183] nl2 = (char)1 [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND FALSE !(\read(ep23)) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] mode3 = (_Bool)0 [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L466] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L517] return (tmp); [L586] c1 = check() [L599] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L601] __VERIFIER_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1325.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 749.5 MB in the end (delta: 331.7 MB). Peak memory consumption was 331.7 MB. Max. memory is 11.5 GB. * CodeCheck took 154222.69 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 135.3 MB). Free memory was 749.5 MB in the beginning and 961.6 MB in the end (delta: -212.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 77.35 ms. Allocated memory is still 1.3 GB. Free memory was 961.6 MB in the beginning and 934.2 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...