./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b21da786d95e06bc319c05bb1d8697b6b032c077 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:38:31,984 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:38:31,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:38:31,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:38:31,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:38:31,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:38:31,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:38:32,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:38:32,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:38:32,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:38:32,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:38:32,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:38:32,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:38:32,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:38:32,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:38:32,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:38:32,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:38:32,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:38:32,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:38:32,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:38:32,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:38:32,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:38:32,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:38:32,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:38:32,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:38:32,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:38:32,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:38:32,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:38:32,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:38:32,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:38:32,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:38:32,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:38:32,024 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:38:32,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:38:32,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:38:32,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:38:32,026 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 21:38:32,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:38:32,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:38:32,040 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:38:32,040 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:38:32,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:38:32,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:38:32,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:38:32,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:38:32,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:38:32,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:38:32,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:38:32,042 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:38:32,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:38:32,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:38:32,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:38:32,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:38:32,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:38:32,043 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 21:38:32,043 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 21:38:32,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:38:32,044 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:38:32,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:38:32,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:38:32,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:38:32,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:38:32,045 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 21:38:32,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:38:32,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:38:32,045 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_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b21da786d95e06bc319c05bb1d8697b6b032c077 [2018-10-26 21:38:32,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:38:32,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:38:32,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:38:32,092 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:38:32,093 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:38:32,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 21:38:32,153 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/data/e46ab7ff5/e93302269e1140849f77105d7bc0f65f/FLAG4ac11c637 [2018-10-26 21:38:32,597 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:38:32,598 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 21:38:32,609 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/data/e46ab7ff5/e93302269e1140849f77105d7bc0f65f/FLAG4ac11c637 [2018-10-26 21:38:32,626 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/data/e46ab7ff5/e93302269e1140849f77105d7bc0f65f [2018-10-26 21:38:32,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:38:32,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:38:32,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:38:32,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:38:32,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:38:32,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:38:32" (1/1) ... [2018-10-26 21:38:32,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b1439a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:32, skipping insertion in model container [2018-10-26 21:38:32,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:38:32" (1/1) ... [2018-10-26 21:38:32,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:38:32,696 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:38:32,923 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:38:32,931 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:38:32,990 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:38:33,006 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:38:33,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33 WrapperNode [2018-10-26 21:38:33,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:38:33,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:38:33,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:38:33,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:38:33,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:38:33,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:38:33,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:38:33,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:38:33,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... [2018-10-26 21:38:33,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:38:33,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:38:33,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:38:33,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:38:33,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:38:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:38:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:38:33,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:38:38,231 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:38:38,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:38:38 BoogieIcfgContainer [2018-10-26 21:38:38,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:38:38,232 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 21:38:38,232 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 21:38:38,243 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 21:38:38,244 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:38:38" (1/1) ... [2018-10-26 21:38:38,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:38:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 21:38:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 21:38:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 21:38:38,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:39,017 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 21:38:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-10-26 21:38:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-26 21:38:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 21:38:39,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:40,136 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 21:38:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-10-26 21:38:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-10-26 21:38:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 21:38:40,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-10-26 21:38:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-10-26 21:38:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 21:38:41,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-10-26 21:38:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-10-26 21:38:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 21:38:42,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-10-26 21:38:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-10-26 21:38:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:38:44,051 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-10-26 21:38:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-10-26 21:38:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:38:45,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-10-26 21:38:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-10-26 21:38:45,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:38:45,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-10-26 21:38:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-10-26 21:38:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:38:46,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 67 states and 113 transitions. [2018-10-26 21:38:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 113 transitions. [2018-10-26 21:38:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 21:38:48,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:48,908 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-10-26 21:38:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-10-26 21:38:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-10-26 21:38:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:38:49,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:38:51,294 WARN L179 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-10-26 21:38:54,419 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-26 21:38:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:38:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 88 states and 158 transitions. [2018-10-26 21:38:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 158 transitions. [2018-10-26 21:38:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:38:54,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:38:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:38:56,161 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-26 21:38:56,393 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 21:38:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 102 states and 182 transitions. [2018-10-26 21:39:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 182 transitions. [2018-10-26 21:39:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:39:00,004 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 105 states and 186 transitions. [2018-10-26 21:39:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 186 transitions. [2018-10-26 21:39:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:39:01,209 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 119 states and 211 transitions. [2018-10-26 21:39:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 211 transitions. [2018-10-26 21:39:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:39:05,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 121 states and 214 transitions. [2018-10-26 21:39:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 214 transitions. [2018-10-26 21:39:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:39:07,127 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 122 states and 217 transitions. [2018-10-26 21:39:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 217 transitions. [2018-10-26 21:39:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:39:08,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:09,527 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-26 21:39:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 124 states and 221 transitions. [2018-10-26 21:39:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 221 transitions. [2018-10-26 21:39:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:39:10,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 126 states and 225 transitions. [2018-10-26 21:39:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 225 transitions. [2018-10-26 21:39:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:39:11,292 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 147 states and 267 transitions. [2018-10-26 21:39:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 267 transitions. [2018-10-26 21:39:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:39:18,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 151 states and 279 transitions. [2018-10-26 21:39:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 279 transitions. [2018-10-26 21:39:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:39:20,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 153 states and 289 transitions. [2018-10-26 21:39:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 289 transitions. [2018-10-26 21:39:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:39:21,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 156 states and 296 transitions. [2018-10-26 21:39:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 296 transitions. [2018-10-26 21:39:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:39:23,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 158 states and 300 transitions. [2018-10-26 21:39:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 300 transitions. [2018-10-26 21:39:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:39:23,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 178 states and 343 transitions. [2018-10-26 21:39:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 343 transitions. [2018-10-26 21:39:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:39:33,131 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 179 states and 344 transitions. [2018-10-26 21:39:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 344 transitions. [2018-10-26 21:39:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:39:34,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 181 states and 352 transitions. [2018-10-26 21:39:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 352 transitions. [2018-10-26 21:39:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:39:35,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:37,630 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-10-26 21:39:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 184 states and 361 transitions. [2018-10-26 21:39:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 361 transitions. [2018-10-26 21:39:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:39:39,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 186 states and 365 transitions. [2018-10-26 21:39:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 365 transitions. [2018-10-26 21:39:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:39:40,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:41,694 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-10-26 21:39:42,605 WARN L179 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-10-26 21:39:43,305 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-26 21:39:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 191 states and 380 transitions. [2018-10-26 21:39:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 380 transitions. [2018-10-26 21:39:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:39:44,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 195 states and 394 transitions. [2018-10-26 21:39:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 394 transitions. [2018-10-26 21:39:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:39:47,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 201 states and 409 transitions. [2018-10-26 21:39:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 409 transitions. [2018-10-26 21:39:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:39:49,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 204 states and 412 transitions. [2018-10-26 21:39:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 412 transitions. [2018-10-26 21:39:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:39:51,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 205 states and 413 transitions. [2018-10-26 21:39:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 413 transitions. [2018-10-26 21:39:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:39:52,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 209 states and 422 transitions. [2018-10-26 21:39:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 422 transitions. [2018-10-26 21:39:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:39:54,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:39:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:39:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 211 states and 425 transitions. [2018-10-26 21:39:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 425 transitions. [2018-10-26 21:39:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:39:55,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:39:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:39:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 224 states and 444 transitions. [2018-10-26 21:40:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 444 transitions. [2018-10-26 21:40:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:40:03,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:04,443 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-10-26 21:40:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 226 states and 450 transitions. [2018-10-26 21:40:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 450 transitions. [2018-10-26 21:40:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:40:04,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 231 states and 462 transitions. [2018-10-26 21:40:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 462 transitions. [2018-10-26 21:40:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:40:08,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 233 states and 475 transitions. [2018-10-26 21:40:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 475 transitions. [2018-10-26 21:40:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:40:09,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 235 states and 478 transitions. [2018-10-26 21:40:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 478 transitions. [2018-10-26 21:40:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:40:11,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 236 states and 479 transitions. [2018-10-26 21:40:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 479 transitions. [2018-10-26 21:40:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:40:12,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 238 states and 489 transitions. [2018-10-26 21:40:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 489 transitions. [2018-10-26 21:40:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:40:13,025 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 240 states and 498 transitions. [2018-10-26 21:40:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 498 transitions. [2018-10-26 21:40:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:40:14,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 272 states and 610 transitions. [2018-10-26 21:40:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 610 transitions. [2018-10-26 21:40:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:40:31,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 276 states and 618 transitions. [2018-10-26 21:40:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 618 transitions. [2018-10-26 21:40:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:40:33,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 280 states and 626 transitions. [2018-10-26 21:40:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 626 transitions. [2018-10-26 21:40:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:40:36,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 283 states and 635 transitions. [2018-10-26 21:40:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 635 transitions. [2018-10-26 21:40:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:40:39,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 284 states and 636 transitions. [2018-10-26 21:40:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 636 transitions. [2018-10-26 21:40:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:40:40,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 297 states and 675 transitions. [2018-10-26 21:40:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 675 transitions. [2018-10-26 21:40:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:40:51,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 299 states and 694 transitions. [2018-10-26 21:40:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 694 transitions. [2018-10-26 21:40:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:40:52,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 301 states and 699 transitions. [2018-10-26 21:40:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 699 transitions. [2018-10-26 21:40:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:40:53,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 304 states and 704 transitions. [2018-10-26 21:40:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 704 transitions. [2018-10-26 21:40:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:40:56,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 306 states and 707 transitions. [2018-10-26 21:40:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 707 transitions. [2018-10-26 21:40:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:40:58,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:40:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:40:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 307 states and 708 transitions. [2018-10-26 21:40:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 708 transitions. [2018-10-26 21:40:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:40:59,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:40:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:40:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 309 states and 710 transitions. [2018-10-26 21:41:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 710 transitions. [2018-10-26 21:41:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:41:00,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 311 states and 712 transitions. [2018-10-26 21:41:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 712 transitions. [2018-10-26 21:41:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:41:01,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:09,178 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-26 21:41:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 320 states and 726 transitions. [2018-10-26 21:41:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 726 transitions. [2018-10-26 21:41:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:41:12,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 319 states and 723 transitions. [2018-10-26 21:41:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 723 transitions. [2018-10-26 21:41:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:41:13,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 322 states and 726 transitions. [2018-10-26 21:41:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 726 transitions. [2018-10-26 21:41:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:41:16,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 316 states and 719 transitions. [2018-10-26 21:41:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 719 transitions. [2018-10-26 21:41:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:41:17,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 324 states and 731 transitions. [2018-10-26 21:41:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 731 transitions. [2018-10-26 21:41:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:41:27,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 326 states and 733 transitions. [2018-10-26 21:41:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 733 transitions. [2018-10-26 21:41:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:41:28,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 321 states and 727 transitions. [2018-10-26 21:41:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 727 transitions. [2018-10-26 21:41:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:30,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 335 states and 767 transitions. [2018-10-26 21:41:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 767 transitions. [2018-10-26 21:41:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:43,844 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 347 states and 791 transitions. [2018-10-26 21:41:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 791 transitions. [2018-10-26 21:41:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:50,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:52,084 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-10-26 21:41:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 349 states and 797 transitions. [2018-10-26 21:41:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 797 transitions. [2018-10-26 21:41:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:53,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 350 states and 798 transitions. [2018-10-26 21:41:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 798 transitions. [2018-10-26 21:41:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:53,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 351 states and 799 transitions. [2018-10-26 21:41:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 799 transitions. [2018-10-26 21:41:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:55,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 354 states and 809 transitions. [2018-10-26 21:41:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 809 transitions. [2018-10-26 21:41:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:57,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:41:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:41:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:41:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 355 states and 810 transitions. [2018-10-26 21:41:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 810 transitions. [2018-10-26 21:41:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:41:59,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:41:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 356 states and 811 transitions. [2018-10-26 21:42:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 811 transitions. [2018-10-26 21:42:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:42:01,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 358 states and 815 transitions. [2018-10-26 21:42:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 815 transitions. [2018-10-26 21:42:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:42:02,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 363 states and 826 transitions. [2018-10-26 21:42:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 826 transitions. [2018-10-26 21:42:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:42:08,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 365 states and 829 transitions. [2018-10-26 21:42:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 829 transitions. [2018-10-26 21:42:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:42:10,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 367 states and 834 transitions. [2018-10-26 21:42:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 834 transitions. [2018-10-26 21:42:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:42:12,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 369 states and 837 transitions. [2018-10-26 21:42:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 837 transitions. [2018-10-26 21:42:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:13,889 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 378 states and 855 transitions. [2018-10-26 21:42:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 855 transitions. [2018-10-26 21:42:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:21,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:22,359 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-26 21:42:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 382 states and 865 transitions. [2018-10-26 21:42:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 865 transitions. [2018-10-26 21:42:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:24,910 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 386 states and 880 transitions. [2018-10-26 21:42:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 880 transitions. [2018-10-26 21:42:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:29,105 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 388 states and 886 transitions. [2018-10-26 21:42:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 886 transitions. [2018-10-26 21:42:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:30,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 392 states and 896 transitions. [2018-10-26 21:42:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 896 transitions. [2018-10-26 21:42:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:34,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 394 states and 899 transitions. [2018-10-26 21:42:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 899 transitions. [2018-10-26 21:42:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:35,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 396 states and 903 transitions. [2018-10-26 21:42:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 903 transitions. [2018-10-26 21:42:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:36,956 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 398 states and 906 transitions. [2018-10-26 21:42:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 906 transitions. [2018-10-26 21:42:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:42:38,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:42:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:42:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:42:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 400 states and 912 transitions. [2018-10-26 21:42:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 912 transitions. [2018-10-26 21:42:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 21:42:40,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:42:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:42:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:42:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:42:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:42:42,970 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 86 iterations. [2018-10-26 21:42:43,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 09:42:43 ImpRootNode [2018-10-26 21:42:43,166 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 21:42:43,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:42:43,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:42:43,167 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:42:43,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:38:38" (3/4) ... [2018-10-26 21:42:43,171 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:42:43,352 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d8977316-247c-46d1-83d4-a75ddec16a12/bin-2019/ukojak/witness.graphml [2018-10-26 21:42:43,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:42:43,355 INFO L168 Benchmark]: Toolchain (without parser) took 250724.48 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 957.1 MB in the beginning and 1.7 GB in the end (delta: -705.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-26 21:42:43,355 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:42:43,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.66 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:42:43,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:42:43,356 INFO L168 Benchmark]: Boogie Preprocessor took 110.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:42:43,356 INFO L168 Benchmark]: RCFGBuilder took 5059.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.6 MB). Peak memory consumption was 263.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:42:43,356 INFO L168 Benchmark]: CodeCheck took 244933.99 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -612.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-26 21:42:43,356 INFO L168 Benchmark]: Witness Printer took 187.52 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:42:43,358 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 130 locations, 1 error locations. UNSAFE Result, 244.6s OverallTime, 86 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 316701692 SDtfs, -681825440 SDslu, -439067308 SDs, 0 SdLazy, -643467124 SolverSat, -1745541332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 317.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28839 GetRequests, 25731 SyntacticMatches, 1918 SemanticMatches, 1190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929759 ImplicationChecksByTransitivity, 222.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 8.0s SatisfiabilityAnalysisTime, 42.1s InterpolantComputationTime, 2774 NumberOfCodeBlocks, 2774 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 2637 ConstructedInterpolants, 0 QuantifiedInterpolants, 1138557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 85 InterpolantComputations, 10 PerfectInterpolantSequences, 298/1690 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L554] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND TRUE \read(r121) [L291] COND TRUE \read(ep23) [L292] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND FALSE !(\read(r211)) [L303] COND TRUE \read(r231) [L304] COND TRUE \read(ep31) [L305] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND TRUE \read(r231) [L314] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND TRUE \read(r311) [L343] COND TRUE \read(ep12) [L344] tmp___4 = 1 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] RET return (tmp___5); [L554] EXPR init() [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=-2, m2=0, m3=-2, max1=1, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=4, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND TRUE (int )m1 > (int )max1 [L133] max1 = m1 [L136] COND FALSE !((int )r1 == 2) [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND TRUE (int )m2 > (int )max2 [L169] max2 = m2 [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=1, m3=0, max1=4, max2=1, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, 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=4, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND 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 FALSE !((int )max1 == (int )id1) [L140] st1 = (char)1 [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND TRUE (int )m2 > (int )max2 [L169] max2 = m2 [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND FALSE !((int )max2 == (int )id2) [L183] nl2 = (char)1 [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=4, m3=1, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=4, m3=1, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=4, m3=1, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L601] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=0, id3=4, m1=4, m2=4, m3=1, max1=4, max2=4, max3=4, 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.66 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5059.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.6 MB). Peak memory consumption was 263.7 MB. Max. memory is 11.5 GB. * CodeCheck took 244933.99 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -612.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 187.52 ms. Allocated memory is still 2.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...