./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/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 597d75969acc1d8bcee1b027bc47b6559ce75136 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:21:14,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:21:14,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:21:14,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:21:14,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:21:14,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:21:14,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:21:14,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:21:14,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:21:14,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:21:14,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:21:14,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:21:14,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:21:14,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:21:14,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:21:14,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:21:14,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:21:14,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:21:14,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:21:14,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:21:14,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:21:14,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:21:14,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:21:14,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:21:14,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:21:14,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:21:14,833 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:21:14,833 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:21:14,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:21:14,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:21:14,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:21:14,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:21:14,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:21:14,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:21:14,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:21:14,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:21:14,837 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-01 17:21:14,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:21:14,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:21:14,848 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 17:21:14,848 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 17:21:14,848 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:21:14,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:21:14,849 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 17:21:14,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:21:14,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 17:21:14,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:21:14,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 17:21:14,850 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 17:21:14,850 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 17:21:14,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:21:14,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:21:14,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 17:21:14,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:21:14,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:21:14,851 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 17:21:14,851 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 17:21:14,851 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:21:14,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 17:21:14,851 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_2ca6d64e-21d7-4eed-8717-cdb65ea28815/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 -> 597d75969acc1d8bcee1b027bc47b6559ce75136 [2018-12-01 17:21:14,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:21:14,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:21:14,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:21:14,885 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:21:14,886 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:21:14,886 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-12-01 17:21:14,931 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/data/316c5eed7/d5cda247367547268ba51106c4f81947/FLAG7cecf4362 [2018-12-01 17:21:15,349 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:21:15,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-12-01 17:21:15,354 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/data/316c5eed7/d5cda247367547268ba51106c4f81947/FLAG7cecf4362 [2018-12-01 17:21:15,362 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/data/316c5eed7/d5cda247367547268ba51106c4f81947 [2018-12-01 17:21:15,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:21:15,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:21:15,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:21:15,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:21:15,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:21:15,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c0e1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15, skipping insertion in model container [2018-12-01 17:21:15,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:21:15,396 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:21:15,521 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:21:15,526 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:21:15,589 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:21:15,599 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:21:15,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15 WrapperNode [2018-12-01 17:21:15,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:21:15,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:21:15,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:21:15,600 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:21:15,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:21:15,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:21:15,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:21:15,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:21:15,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... [2018-12-01 17:21:15,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:21:15,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:21:15,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:21:15,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:21:15,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:21:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 17:21:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:21:15,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:21:17,018 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:21:17,018 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-01 17:21:17,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:21:17 BoogieIcfgContainer [2018-12-01 17:21:17,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:21:17,018 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 17:21:17,019 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 17:21:17,025 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 17:21:17,025 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:21:17" (1/1) ... [2018-12-01 17:21:17,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:21:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-01 17:21:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-01 17:21:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 17:21:17,059 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-01 17:21:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-01 17:21:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:21:17,370 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-01 17:21:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-01 17:21:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 17:21:17,654 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-01 17:21:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-01 17:21:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 17:21:17,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 31 states and 56 transitions. [2018-12-01 17:21:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. [2018-12-01 17:21:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:21:18,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 36 states and 65 transitions. [2018-12-01 17:21:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 65 transitions. [2018-12-01 17:21:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 17:21:19,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 42 states and 76 transitions. [2018-12-01 17:21:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 76 transitions. [2018-12-01 17:21:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 17:21:19,981 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2018-12-01 17:21:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2018-12-01 17:21:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 17:21:20,184 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-01 17:21:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-01 17:21:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 17:21:20,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 51 states and 88 transitions. [2018-12-01 17:21:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 88 transitions. [2018-12-01 17:21:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 17:21:20,944 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 54 states and 99 transitions. [2018-12-01 17:21:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 99 transitions. [2018-12-01 17:21:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 17:21:21,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 69 states and 129 transitions. [2018-12-01 17:21:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 129 transitions. [2018-12-01 17:21:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 17:21:23,800 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 75 states and 143 transitions. [2018-12-01 17:21:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 143 transitions. [2018-12-01 17:21:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 17:21:26,003 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 76 states and 146 transitions. [2018-12-01 17:21:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 146 transitions. [2018-12-01 17:21:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 17:21:26,386 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 79 states and 154 transitions. [2018-12-01 17:21:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 154 transitions. [2018-12-01 17:21:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 17:21:29,528 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 81 states and 159 transitions. [2018-12-01 17:21:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 159 transitions. [2018-12-01 17:21:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:21:30,014 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 85 states and 170 transitions. [2018-12-01 17:21:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 170 transitions. [2018-12-01 17:21:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:21:31,914 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 87 states and 173 transitions. [2018-12-01 17:21:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 173 transitions. [2018-12-01 17:21:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:21:32,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 88 states and 176 transitions. [2018-12-01 17:21:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 176 transitions. [2018-12-01 17:21:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:21:32,856 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 90 states and 181 transitions. [2018-12-01 17:21:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 181 transitions. [2018-12-01 17:21:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 17:21:33,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:36,578 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-01 17:21:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 98 states and 203 transitions. [2018-12-01 17:21:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 203 transitions. [2018-12-01 17:21:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 17:21:39,107 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 101 states and 208 transitions. [2018-12-01 17:21:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 208 transitions. [2018-12-01 17:21:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 17:21:40,224 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 102 states and 209 transitions. [2018-12-01 17:21:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 209 transitions. [2018-12-01 17:21:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 17:21:40,631 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 103 states and 210 transitions. [2018-12-01 17:21:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 210 transitions. [2018-12-01 17:21:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 17:21:41,061 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 116 states and 235 transitions. [2018-12-01 17:21:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 235 transitions. [2018-12-01 17:21:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 17:21:48,067 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 119 states and 237 transitions. [2018-12-01 17:21:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 237 transitions. [2018-12-01 17:21:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 17:21:51,873 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:21:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:21:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:21:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 133 states and 282 transitions. [2018-12-01 17:21:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 282 transitions. [2018-12-01 17:21:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 17:21:59,321 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:21:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 137 states and 291 transitions. [2018-12-01 17:22:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 291 transitions. [2018-12-01 17:22:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 17:22:04,927 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 138 states and 292 transitions. [2018-12-01 17:22:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 292 transitions. [2018-12-01 17:22:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 17:22:05,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 139 states and 298 transitions. [2018-12-01 17:22:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 298 transitions. [2018-12-01 17:22:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 17:22:05,871 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 146 states and 314 transitions. [2018-12-01 17:22:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 314 transitions. [2018-12-01 17:22:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 17:22:09,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 147 states and 317 transitions. [2018-12-01 17:22:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 317 transitions. [2018-12-01 17:22:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 17:22:10,390 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 148 states and 318 transitions. [2018-12-01 17:22:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 318 transitions. [2018-12-01 17:22:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 17:22:10,841 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 149 states and 321 transitions. [2018-12-01 17:22:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 321 transitions. [2018-12-01 17:22:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 17:22:11,280 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 150 states and 324 transitions. [2018-12-01 17:22:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 324 transitions. [2018-12-01 17:22:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 17:22:11,815 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 164 states and 355 transitions. [2018-12-01 17:22:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 355 transitions. [2018-12-01 17:22:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 17:22:21,043 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 165 states and 358 transitions. [2018-12-01 17:22:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 358 transitions. [2018-12-01 17:22:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 17:22:21,922 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 166 states and 361 transitions. [2018-12-01 17:22:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 361 transitions. [2018-12-01 17:22:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 17:22:22,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 168 states and 369 transitions. [2018-12-01 17:22:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 369 transitions. [2018-12-01 17:22:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:22:25,109 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 174 states and 390 transitions. [2018-12-01 17:22:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 390 transitions. [2018-12-01 17:22:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:22:33,102 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 175 states and 392 transitions. [2018-12-01 17:22:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 392 transitions. [2018-12-01 17:22:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:22:34,699 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 177 states and 401 transitions. [2018-12-01 17:22:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 401 transitions. [2018-12-01 17:22:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:22:36,343 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 178 states and 402 transitions. [2018-12-01 17:22:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 402 transitions. [2018-12-01 17:22:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:22:37,106 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 179 states and 405 transitions. [2018-12-01 17:22:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 405 transitions. [2018-12-01 17:22:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:22:37,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 180 states and 408 transitions. [2018-12-01 17:22:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 408 transitions. [2018-12-01 17:22:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:22:38,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 193 states and 440 transitions. [2018-12-01 17:22:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 440 transitions. [2018-12-01 17:22:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:22:51,960 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:22:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:22:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 195 states and 443 transitions. [2018-12-01 17:22:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 443 transitions. [2018-12-01 17:22:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:22:54,756 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:22:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:22:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 200 states and 457 transitions. [2018-12-01 17:23:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 457 transitions. [2018-12-01 17:23:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:23:02,223 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 203 states and 467 transitions. [2018-12-01 17:23:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 467 transitions. [2018-12-01 17:23:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:23:05,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 204 states and 468 transitions. [2018-12-01 17:23:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 468 transitions. [2018-12-01 17:23:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:23:06,326 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 207 states and 478 transitions. [2018-12-01 17:23:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 478 transitions. [2018-12-01 17:23:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:23:10,589 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 208 states and 479 transitions. [2018-12-01 17:23:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 479 transitions. [2018-12-01 17:23:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:23:11,837 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 211 states and 489 transitions. [2018-12-01 17:23:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 489 transitions. [2018-12-01 17:23:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:23:13,807 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 212 states and 492 transitions. [2018-12-01 17:23:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 492 transitions. [2018-12-01 17:23:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 17:23:15,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-01 17:23:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 212 states and 491 transitions. [2018-12-01 17:23:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 491 transitions. [2018-12-01 17:23:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:15,385 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 220 states and 514 transitions. [2018-12-01 17:23:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 514 transitions. [2018-12-01 17:23:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:36,192 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 227 states and 532 transitions. [2018-12-01 17:23:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 532 transitions. [2018-12-01 17:23:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:43,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 231 states and 538 transitions. [2018-12-01 17:23:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 538 transitions. [2018-12-01 17:23:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:46,454 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 234 states and 547 transitions. [2018-12-01 17:23:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 547 transitions. [2018-12-01 17:23:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:49,352 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 235 states and 547 transitions. [2018-12-01 17:23:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 547 transitions. [2018-12-01 17:23:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:49,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 236 states and 551 transitions. [2018-12-01 17:23:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 551 transitions. [2018-12-01 17:23:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:50,883 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 238 states and 552 transitions. [2018-12-01 17:23:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 552 transitions. [2018-12-01 17:23:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 17:23:52,358 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:23:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 239 states and 552 transitions. [2018-12-01 17:23:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 552 transitions. [2018-12-01 17:23:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-01 17:23:53,307 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:23:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 17:23:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 17:23:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 239 states and 539 transitions. [2018-12-01 17:23:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 539 transitions. [2018-12-01 17:23:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 17:23:54,452 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 17:23:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:23:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:23:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:23:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:23:55,408 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 64 iterations. [2018-12-01 17:23:55,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:23:55 ImpRootNode [2018-12-01 17:23:55,491 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 17:23:55,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:23:55,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:23:55,492 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:23:55,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:21:17" (3/4) ... [2018-12-01 17:23:55,493 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 17:23:55,570 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2ca6d64e-21d7-4eed-8717-cdb65ea28815/bin-2019/ukojak/witness.graphml [2018-12-01 17:23:55,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:23:55,571 INFO L168 Benchmark]: Toolchain (without parser) took 160206.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 960.3 MB in the beginning and 877.5 MB in the end (delta: 82.8 MB). Peak memory consumption was 299.3 MB. Max. memory is 11.5 GB. [2018-12-01 17:23:55,571 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:23:55,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:23:55,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.73 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:23:55,571 INFO L168 Benchmark]: Boogie Preprocessor took 20.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:23:55,571 INFO L168 Benchmark]: RCFGBuilder took 1368.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.4 MB). Peak memory consumption was 331.5 MB. Max. memory is 11.5 GB. [2018-12-01 17:23:55,572 INFO L168 Benchmark]: CodeCheck took 158472.72 ms. Allocated memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: -10.5 MB). Free memory was 1.2 GB in the beginning and 902.4 MB in the end (delta: 293.6 MB). Peak memory consumption was 283.1 MB. Max. memory is 11.5 GB. [2018-12-01 17:23:55,572 INFO L168 Benchmark]: Witness Printer took 78.74 ms. Allocated memory is still 1.2 GB. Free memory was 902.4 MB in the beginning and 877.5 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-01 17:23:55,573 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, 140 locations, 1 error locations. UNSAFE Result, 158.3s OverallTime, 64 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 356207368 SDslu, 1024 SDs, 0 SdLazy, -1776671006 SolverSat, -2972470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 109.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19566 GetRequests, 17437 SyntacticMatches, 1219 SemanticMatches, 910 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521866 ImplicationChecksByTransitivity, 148.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 1896 NumberOfCodeBlocks, 1896 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1788 ConstructedInterpolants, 0 QuantifiedInterpolants, 785683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 63 InterpolantComputations, 11 PerfectInterpolantSequences, 276/1267 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: 628]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L547] int c1 ; [L548] int i2 ; [L551] c1 = 0 [L552] ep12 = __VERIFIER_nondet_bool() [L553] ep13 = __VERIFIER_nondet_bool() [L554] ep21 = __VERIFIER_nondet_bool() [L555] ep23 = __VERIFIER_nondet_bool() [L556] ep31 = __VERIFIER_nondet_bool() [L557] ep32 = __VERIFIER_nondet_bool() [L558] id1 = __VERIFIER_nondet_char() [L559] r1 = __VERIFIER_nondet_uchar() [L560] st1 = __VERIFIER_nondet_char() [L561] nl1 = __VERIFIER_nondet_char() [L562] m1 = __VERIFIER_nondet_char() [L563] max1 = __VERIFIER_nondet_char() [L564] mode1 = __VERIFIER_nondet_bool() [L565] newmax1 = __VERIFIER_nondet_bool() [L566] id2 = __VERIFIER_nondet_char() [L567] r2 = __VERIFIER_nondet_uchar() [L568] st2 = __VERIFIER_nondet_char() [L569] nl2 = __VERIFIER_nondet_char() [L570] m2 = __VERIFIER_nondet_char() [L571] max2 = __VERIFIER_nondet_char() [L572] mode2 = __VERIFIER_nondet_bool() [L573] newmax2 = __VERIFIER_nondet_bool() [L574] id3 = __VERIFIER_nondet_char() [L575] r3 = __VERIFIER_nondet_uchar() [L576] st3 = __VERIFIER_nondet_char() [L577] nl3 = __VERIFIER_nondet_char() [L578] m3 = __VERIFIER_nondet_char() [L579] max3 = __VERIFIER_nondet_char() [L580] mode3 = __VERIFIER_nondet_bool() [L581] newmax3 = __VERIFIER_nondet_bool() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND TRUE \read(r121) [L312] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND FALSE !(\read(r131)) [L327] COND TRUE \read(r121) [L328] COND TRUE \read(ep23) [L329] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND FALSE !(\read(r211)) [L340] COND TRUE \read(r231) [L341] COND FALSE !(\read(ep31)) [L344] tmp___1 = 0 [L349] r212 = (_Bool )tmp___1 [L350] COND TRUE \read(r231) [L351] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND FALSE !(\read(r311)) [L366] COND TRUE \read(r321) [L367] COND FALSE !(\read(ep21)) [L370] tmp___3 = 0 [L375] r312 = (_Bool )tmp___3 [L376] COND TRUE \read(r321) [L377] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE (int )max1 == (int )id1 [L399] COND TRUE (int )max2 == (int )id2 [L400] COND TRUE (int )max3 == (int )id3 [L401] COND TRUE (int )st1 == 0 [L402] COND TRUE (int )st2 == 0 [L403] COND TRUE (int )st3 == 0 [L404] COND TRUE (int )nl1 == 0 [L405] COND TRUE (int )nl2 == 0 [L406] COND TRUE (int )nl3 == 0 [L407] COND TRUE (int )mode1 == 0 [L408] COND TRUE (int )mode2 == 0 [L409] COND TRUE (int )mode3 == 0 [L410] COND TRUE \read(newmax1) [L411] COND TRUE \read(newmax2) [L412] COND TRUE \read(newmax3) [L413] tmp___5 = 1 [L486] return (tmp___5); [L582] i2 = init() [L584] p12_old = nomsg [L585] p12_new = nomsg [L586] p13_old = nomsg [L587] p13_new = nomsg [L588] p21_old = nomsg [L589] p21_new = nomsg [L590] p23_old = nomsg [L591] p23_new = nomsg [L592] p31_old = nomsg [L593] p31_new = nomsg [L594] p32_old = nomsg [L595] p32_new = nomsg [L596] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND TRUE \read(newmax1) [L159] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L159] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND TRUE \read(ep23) [L217] COND TRUE \read(newmax2) [L218] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L218] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=2, m3=4, max1=0, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, 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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND TRUE (int )m3 > (int )max3 [L250] max3 = m3 [L251] newmax = (_Bool)1 [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND TRUE \read(ep12) [L158] COND FALSE !(\read(newmax1)) [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND TRUE \read(ep23) [L217] COND FALSE !(\read(newmax2)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND FALSE !(\read(ep31)) [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=1, m3=3, max1=0, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND FALSE !(\read(ep31)) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND TRUE (int )max1 == (int )id1 [L149] st1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND TRUE \read(ep12) [L185] m2 = p12_old [L186] p12_old = nomsg [L187] COND FALSE !((int )m2 > (int )max2) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND FALSE !((int )m3 > (int )max3) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND FALSE !((int )max3 == (int )id3) [L259] nl3 = (char)1 [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=3, m3=-1, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] [L494] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L540] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=3, m3=-1, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] [L542] return (tmp); [L614] c1 = check() [L626] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=3, m3=-1, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] [L628] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=0, ep32=1, id1=0, id2=3, id3=1, m1=1, m2=3, m3=-1, max1=0, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.73 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1368.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.4 MB). Peak memory consumption was 331.5 MB. Max. memory is 11.5 GB. * CodeCheck took 158472.72 ms. Allocated memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: -10.5 MB). Free memory was 1.2 GB in the beginning and 902.4 MB in the end (delta: 293.6 MB). Peak memory consumption was 283.1 MB. Max. memory is 11.5 GB. * Witness Printer took 78.74 ms. Allocated memory is still 1.2 GB. Free memory was 902.4 MB in the beginning and 877.5 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...