./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.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_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/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 3381374679dc4a7458d725215e8a6e295cc6e6a1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 23:58:52,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:58:52,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:58:52,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:58:52,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:58:52,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:58:52,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:58:52,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:58:52,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:58:52,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:58:52,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:58:52,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:58:52,979 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:58:52,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:58:52,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:58:52,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:58:52,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:58:52,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:58:52,983 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:58:52,984 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:58:52,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:58:52,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:58:52,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:58:52,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:58:52,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:58:52,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:58:52,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:58:52,987 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:58:52,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:58:52,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:58:52,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:58:52,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:58:52,989 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:58:52,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:58:52,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:58:52,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:58:52,990 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 23:58:52,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:58:52,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:58:52,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:58:52,998 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 23:58:52,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 23:58:52,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 23:58:52,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:58:52,998 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:58:52,998 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:58:52,998 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:58:52,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:58:52,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 23:58:52,999 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 23:58:52,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 23:58:52,999 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:58:52,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:58:53,000 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 23:58:53,000 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 23:58:53,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:58:53,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 23:58:53,000 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_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/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 -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2018-12-08 23:58:53,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:58:53,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:58:53,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:58:53,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:58:53,032 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:58:53,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 23:58:53,074 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/data/aa2a0987d/6709ad37850646c19f04d885d7a4fb02/FLAG84aa37e36 [2018-12-08 23:58:53,541 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:58:53,542 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 23:58:53,547 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/data/aa2a0987d/6709ad37850646c19f04d885d7a4fb02/FLAG84aa37e36 [2018-12-08 23:58:54,053 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/data/aa2a0987d/6709ad37850646c19f04d885d7a4fb02 [2018-12-08 23:58:54,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:58:54,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:58:54,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:58:54,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:58:54,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:58:54,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a96ab85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54, skipping insertion in model container [2018-12-08 23:58:54,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:58:54,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:58:54,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:58:54,220 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:58:54,283 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:58:54,296 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:58:54,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54 WrapperNode [2018-12-08 23:58:54,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:58:54,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 23:58:54,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 23:58:54,297 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 23:58:54,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 23:58:54,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:58:54,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:58:54,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:58:54,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... [2018-12-08 23:58:54,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:58:54,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:58:54,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:58:54,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:58:54,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:58:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/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-08 23:58:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:58:54,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:58:55,506 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:58:55,506 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 23:58:55,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:58:55 BoogieIcfgContainer [2018-12-08 23:58:55,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:58:55,507 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 23:58:55,507 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 23:58:55,514 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 23:58:55,514 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:58:55" (1/1) ... [2018-12-08 23:58:55,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:58:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-08 23:58:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-08 23:58:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 23:58:55,544 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:55,822 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-08 23:58:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-08 23:58:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-08 23:58:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 23:58:55,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:56,009 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-08 23:58:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-08 23:58:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-08 23:58:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 23:58:56,161 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:56,253 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-08 23:58:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-08 23:58:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-08 23:58:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 23:58:56,499 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:56,592 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-08 23:58:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-08 23:58:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-08 23:58:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 23:58:56,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:57,045 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-08 23:58:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-08 23:58:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-08 23:58:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 23:58:57,555 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:57,670 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-08 23:58:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-08 23:58:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-08 23:58:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 23:58:58,289 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:58,364 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-08 23:58:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-08 23:58:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-08 23:58:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 23:58:58,518 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:58,539 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-08 23:58:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:58:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-08 23:58:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-08 23:58:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 23:58:58,550 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:58:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:58:58,683 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-08 23:59:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-08 23:59:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-08 23:59:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 23:59:00,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:00,630 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-08 23:59:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-08 23:59:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-08 23:59:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 23:59:00,787 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:01,468 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-08 23:59:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 77 states and 143 transitions. [2018-12-08 23:59:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 143 transitions. [2018-12-08 23:59:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 23:59:04,122 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:04,508 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-08 23:59:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 94 states and 179 transitions. [2018-12-08 23:59:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 179 transitions. [2018-12-08 23:59:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 23:59:08,159 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:08,233 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-08 23:59:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 95 states and 181 transitions. [2018-12-08 23:59:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 181 transitions. [2018-12-08 23:59:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 23:59:08,437 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:09,342 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-08 23:59:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 113 states and 220 transitions. [2018-12-08 23:59:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 220 transitions. [2018-12-08 23:59:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 23:59:14,255 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:14,331 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-08 23:59:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 114 states and 224 transitions. [2018-12-08 23:59:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 224 transitions. [2018-12-08 23:59:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:59:14,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:15,764 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-08 23:59:18,546 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-08 23:59:19,832 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-08 23:59:20,445 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-08 23:59:22,767 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-08 23:59:23,290 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-08 23:59:23,774 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2018-12-08 23:59:24,921 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-08 23:59:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 129 states and 256 transitions. [2018-12-08 23:59:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 256 transitions. [2018-12-08 23:59:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:59:26,887 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:27,121 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-08 23:59:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 132 states and 265 transitions. [2018-12-08 23:59:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 265 transitions. [2018-12-08 23:59:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:59:28,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:29,391 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-08 23:59:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 151 states and 304 transitions. [2018-12-08 23:59:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 304 transitions. [2018-12-08 23:59:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:59:37,179 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:37,262 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-08 23:59:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 155 states and 316 transitions. [2018-12-08 23:59:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 316 transitions. [2018-12-08 23:59:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:39,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:39,500 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-08 23:59:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 158 states and 323 transitions. [2018-12-08 23:59:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 323 transitions. [2018-12-08 23:59:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:41,154 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:41,251 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-08 23:59:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 159 states and 325 transitions. [2018-12-08 23:59:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 325 transitions. [2018-12-08 23:59:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:41,623 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:41,684 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-08 23:59:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 160 states and 326 transitions. [2018-12-08 23:59:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 326 transitions. [2018-12-08 23:59:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:41,862 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:41,922 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-08 23:59:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 161 states and 327 transitions. [2018-12-08 23:59:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 327 transitions. [2018-12-08 23:59:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:59:42,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:42,277 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-08 23:59:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 164 states and 332 transitions. [2018-12-08 23:59:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 332 transitions. [2018-12-08 23:59:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:59:43,475 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:45,527 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-08 23:59:47,598 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 23:59:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 170 states and 352 transitions. [2018-12-08 23:59:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 352 transitions. [2018-12-08 23:59:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:59:52,092 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:52,227 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-08 23:59:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 175 states and 363 transitions. [2018-12-08 23:59:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 363 transitions. [2018-12-08 23:59:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 23:59:53,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:53,793 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-08 23:59:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 23:59:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 176 states and 364 transitions. [2018-12-08 23:59:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 364 transitions. [2018-12-08 23:59:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 23:59:54,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 23:59:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 189 states and 397 transitions. [2018-12-09 00:00:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 397 transitions. [2018-12-09 00:00:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:00:02,750 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 194 states and 408 transitions. [2018-12-09 00:00:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 408 transitions. [2018-12-09 00:00:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:00:06,331 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 197 states and 417 transitions. [2018-12-09 00:00:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 417 transitions. [2018-12-09 00:00:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:00:07,563 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 198 states and 418 transitions. [2018-12-09 00:00:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 418 transitions. [2018-12-09 00:00:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:00:08,154 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 209 states and 437 transitions. [2018-12-09 00:00:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 437 transitions. [2018-12-09 00:00:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:00:14,012 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 211 states and 440 transitions. [2018-12-09 00:00:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 440 transitions. [2018-12-09 00:00:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:00:15,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 209 states and 436 transitions. [2018-12-09 00:00:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 436 transitions. [2018-12-09 00:00:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:00:15,785 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 210 states and 437 transitions. [2018-12-09 00:00:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 437 transitions. [2018-12-09 00:00:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:00:16,354 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:20,322 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-09 00:00:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 222 states and 460 transitions. [2018-12-09 00:00:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 460 transitions. [2018-12-09 00:00:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:00:28,601 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 223 states and 467 transitions. [2018-12-09 00:00:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 467 transitions. [2018-12-09 00:00:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:00:29,306 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 224 states and 468 transitions. [2018-12-09 00:00:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 468 transitions. [2018-12-09 00:00:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:00:30,249 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 217 states and 459 transitions. [2018-12-09 00:00:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 459 transitions. [2018-12-09 00:00:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:00:30,830 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:32,446 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-09 00:00:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 228 states and 483 transitions. [2018-12-09 00:00:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 483 transitions. [2018-12-09 00:00:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:00:39,742 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:39,817 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-09 00:00:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 224 states and 481 transitions. [2018-12-09 00:00:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 481 transitions. [2018-12-09 00:00:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:00:41,367 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:41,452 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-09 00:00:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 225 states and 487 transitions. [2018-12-09 00:00:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 487 transitions. [2018-12-09 00:00:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:00:42,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:43,580 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-09 00:00:45,548 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-09 00:00:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 231 states and 501 transitions. [2018-12-09 00:00:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 501 transitions. [2018-12-09 00:00:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:00:55,339 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:55,565 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-09 00:00:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 232 states and 504 transitions. [2018-12-09 00:00:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 504 transitions. [2018-12-09 00:00:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:00:56,327 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:56,553 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-09 00:00:57,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:00:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 233 states and 509 transitions. [2018-12-09 00:00:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 509 transitions. [2018-12-09 00:00:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:00:57,440 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:00:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:00:57,661 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-09 00:01:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 236 states and 519 transitions. [2018-12-09 00:01:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 519 transitions. [2018-12-09 00:01:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:01:00,029 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:00,274 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-09 00:01:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 242 states and 536 transitions. [2018-12-09 00:01:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 536 transitions. [2018-12-09 00:01:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:01:03,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:03,730 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-09 00:01:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 246 states and 544 transitions. [2018-12-09 00:01:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 544 transitions. [2018-12-09 00:01:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:01:06,774 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:06,849 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-09 00:01:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 247 states and 548 transitions. [2018-12-09 00:01:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 548 transitions. [2018-12-09 00:01:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:01:07,451 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:07,525 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-09 00:01:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 248 states and 551 transitions. [2018-12-09 00:01:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 551 transitions. [2018-12-09 00:01:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:01:08,259 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:08,624 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-09 00:01:11,423 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-09 00:01:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 254 states and 571 transitions. [2018-12-09 00:01:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 571 transitions. [2018-12-09 00:01:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:01:18,677 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:18,827 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-09 00:01:19,182 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-09 00:01:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 255 states and 573 transitions. [2018-12-09 00:01:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 573 transitions. [2018-12-09 00:01:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:01:19,433 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:19,583 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-09 00:01:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 258 states and 582 transitions. [2018-12-09 00:01:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 582 transitions. [2018-12-09 00:01:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:01:22,709 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:22,881 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-09 00:01:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 00:01:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 259 states and 583 transitions. [2018-12-09 00:01:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 583 transitions. [2018-12-09 00:01:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:01:23,285 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 00:01:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:24,105 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 55 iterations. [2018-12-09 00:01:24,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 12:01:24 ImpRootNode [2018-12-09 00:01:24,180 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 00:01:24,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:01:24,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:01:24,181 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:01:24,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:58:55" (3/4) ... [2018-12-09 00:01:24,182 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:01:24,258 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6e2f4027-f899-42a8-b3a9-fc3e12eb5e3f/bin-2019/ukojak/witness.graphml [2018-12-09 00:01:24,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:01:24,258 INFO L168 Benchmark]: Toolchain (without parser) took 150203.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 959.2 MB in the beginning and 886.1 MB in the end (delta: 73.1 MB). Peak memory consumption was 299.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:24,259 INFO L168 Benchmark]: CDTParser took 0.16 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-09 00:01:24,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:24,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.35 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:24,259 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 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-09 00:01:24,259 INFO L168 Benchmark]: RCFGBuilder took 1159.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 782.1 MB in the end (delta: 287.2 MB). Peak memory consumption was 287.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:24,259 INFO L168 Benchmark]: CodeCheck took 148672.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 782.1 MB in the beginning and 904.5 MB in the end (delta: -122.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:24,259 INFO L168 Benchmark]: Witness Printer took 77.47 ms. Allocated memory is still 1.3 GB. Free memory was 904.5 MB in the beginning and 886.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:24,260 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, 123 locations, 1 error locations. UNSAFE Result, 148.5s OverallTime, 55 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -2129010692 SDtfs, 2039302940 SDslu, -1340401420 SDs, 0 SdLazy, -756746708 SolverSat, 76362772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 78.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16215 GetRequests, 14298 SyntacticMatches, 937 SemanticMatches, 980 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592301 ImplicationChecksByTransitivity, 139.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1486 ConstructedInterpolants, 0 QuantifiedInterpolants, 574815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 179/919 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: 577]: 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}; [L498] int c1 ; [L499] int i2 ; [L502] c1 = 0 [L503] ep12 = __VERIFIER_nondet_bool() [L504] ep13 = __VERIFIER_nondet_bool() [L505] ep21 = __VERIFIER_nondet_bool() [L506] ep23 = __VERIFIER_nondet_bool() [L507] ep31 = __VERIFIER_nondet_bool() [L508] ep32 = __VERIFIER_nondet_bool() [L509] id1 = __VERIFIER_nondet_char() [L510] r1 = __VERIFIER_nondet_char() [L511] st1 = __VERIFIER_nondet_char() [L512] nl1 = __VERIFIER_nondet_char() [L513] m1 = __VERIFIER_nondet_char() [L514] max1 = __VERIFIER_nondet_char() [L515] mode1 = __VERIFIER_nondet_bool() [L516] id2 = __VERIFIER_nondet_char() [L517] r2 = __VERIFIER_nondet_char() [L518] st2 = __VERIFIER_nondet_char() [L519] nl2 = __VERIFIER_nondet_char() [L520] m2 = __VERIFIER_nondet_char() [L521] max2 = __VERIFIER_nondet_char() [L522] mode2 = __VERIFIER_nondet_bool() [L523] id3 = __VERIFIER_nondet_char() [L524] r3 = __VERIFIER_nondet_char() [L525] st3 = __VERIFIER_nondet_char() [L526] nl3 = __VERIFIER_nondet_char() [L527] m3 = __VERIFIER_nondet_char() [L528] max3 = __VERIFIER_nondet_char() [L529] 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 FALSE !(\read(r121)) [L277] COND FALSE !(\read(r131)) [L284] tmp = 0 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND FALSE !(\read(r121)) [L297] tmp___0 = 0 [L299] r132 = (_Bool )tmp___0 [L300] COND FALSE !(\read(r211)) [L303] COND FALSE !(\read(r231)) [L310] tmp___1 = 0 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND FALSE !(\read(r211)) [L323] tmp___2 = 0 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] 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 (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] tmp___5 = 1 [L437] return (tmp___5); [L530] i2 = init() [L532] p12_old = nomsg [L533] p12_new = nomsg [L534] p13_old = nomsg [L535] p13_new = nomsg [L536] p21_old = nomsg [L537] p21_new = nomsg [L538] p23_old = nomsg [L539] p23_new = nomsg [L540] p31_old = nomsg [L541] p31_new = nomsg [L542] p32_old = nomsg [L543] p32_new = nomsg [L544] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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] [L545] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND FALSE !(\read(ep13)) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [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 TRUE \read(ep32) [L236] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] mode3 = (_Bool)1 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] return (tmp); [L562] c1 = check() [L575] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=4, m2=1, m3=3, max1=3, max2=0, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND FALSE !((int )r1 == 2) [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND TRUE (int )m2 > (int )max2 [L176] max2 = m2 [L179] COND FALSE !((int )r2 == 2) [L186] mode2 = (_Bool)0 [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] mode3 = (_Bool)0 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] return (tmp); [L562] c1 = check() [L575] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L545] COND TRUE i2 < 6 [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND FALSE !(\read(ep13)) [L153] mode1 = (_Bool)1 [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [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 TRUE \read(ep32) [L236] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] mode3 = (_Bool)1 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] return (tmp); [L562] c1 = check() [L575] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [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 TRUE (int )max1 == (int )id1 [L138] st1 = (char)1 [L143] mode1 = (_Bool)0 [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [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 FALSE !(\read(ep13)) [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 [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L445] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L491] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L493] return (tmp); [L562] c1 = check() [L575] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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] [L577] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=3, id2=0, id3=2, m1=2, m2=2, m3=3, max1=3, max2=2, max3=2, 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.16 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 240.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.35 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.50 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 1159.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 782.1 MB in the end (delta: 287.2 MB). Peak memory consumption was 287.2 MB. Max. memory is 11.5 GB. * CodeCheck took 148672.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 782.1 MB in the beginning and 904.5 MB in the end (delta: -122.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Witness Printer took 77.47 ms. Allocated memory is still 1.3 GB. Free memory was 904.5 MB in the beginning and 886.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...