./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/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 adc229f0a7bc8afe44d4e19612f0edd5de4d255f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-678e011 [2019-11-20 07:11:03,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:11:03,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:11:03,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:11:03,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:11:03,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:11:03,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:11:03,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:11:03,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:11:03,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:11:03,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:11:03,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:11:03,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:11:03,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:11:03,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:11:03,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:11:03,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:11:03,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:11:03,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:11:03,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:11:03,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:11:03,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:11:03,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:11:03,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:11:03,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:11:03,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:11:03,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:11:03,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:11:03,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:11:03,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:11:03,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:11:03,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:11:03,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:11:03,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:11:03,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:11:03,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:11:03,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:11:03,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:11:03,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:11:03,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:11:03,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:11:03,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 07:11:03,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:11:03,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:11:03,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 07:11:03,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 07:11:03,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:11:03,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:11:03,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:11:03,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:11:03,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:11:03,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:11:03,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:11:03,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:11:03,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:11:03,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:11:03,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:11:03,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:11:03,359 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:11:03,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:11:03,359 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 07:11:03,360 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 07:11:03,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:11:03,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:11:03,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 07:11:03,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:11:03,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:11:03,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:11:03,362 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 07:11:03,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:11:03,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:11:03,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/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 -> adc229f0a7bc8afe44d4e19612f0edd5de4d255f [2019-11-20 07:11:03,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:11:03,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:11:03,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:11:03,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:11:03,571 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:11:03,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-11-20 07:11:03,636 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/data/4d24668f1/1373510df96744c082b65575ed29fe6d/FLAG98cbe7259 [2019-11-20 07:11:04,069 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:11:04,069 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2019-11-20 07:11:04,087 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/data/4d24668f1/1373510df96744c082b65575ed29fe6d/FLAG98cbe7259 [2019-11-20 07:11:04,427 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/data/4d24668f1/1373510df96744c082b65575ed29fe6d [2019-11-20 07:11:04,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:11:04,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:11:04,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:11:04,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:11:04,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:11:04,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:04,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ee6956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04, skipping insertion in model container [2019-11-20 07:11:04,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:04,448 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:11:04,497 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:11:04,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:11:04,813 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:11:04,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:11:04,897 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:11:04,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04 WrapperNode [2019-11-20 07:11:04,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:11:04,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:11:04,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:11:04,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:11:04,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:04,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:04,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:11:04,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:11:04,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:11:04,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:11:05,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:05,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:05,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:05,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:05,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:05,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:05,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... [2019-11-20 07:11:05,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:11:05,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:11:05,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:11:05,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:11:05,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/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 [2019-11-20 07:11:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:11:05,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:11:07,943 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:11:07,944 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 07:11:07,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:07 BoogieIcfgContainer [2019-11-20 07:11:07,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:11:07,947 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 07:11:07,947 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 07:11:07,958 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 07:11:07,959 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:07" (1/1) ... [2019-11-20 07:11:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:11:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2019-11-20 07:11:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2019-11-20 07:11:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 07:11:08,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2019-11-20 07:11:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2019-11-20 07:11:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 07:11:08,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2019-11-20 07:11:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2019-11-20 07:11:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 07:11:09,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2019-11-20 07:11:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-20 07:11:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 07:11:10,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2019-11-20 07:11:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2019-11-20 07:11:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 07:11:11,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2019-11-20 07:11:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2019-11-20 07:11:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 07:11:13,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2019-11-20 07:11:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2019-11-20 07:11:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 07:11:14,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2019-11-20 07:11:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2019-11-20 07:11:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:11:15,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2019-11-20 07:11:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2019-11-20 07:11:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:11:15,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2019-11-20 07:11:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2019-11-20 07:11:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 07:11:17,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2019-11-20 07:11:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2019-11-20 07:11:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 07:11:18,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 74 states and 139 transitions. [2019-11-20 07:11:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2019-11-20 07:11:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 07:11:24,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 85 states and 158 transitions. [2019-11-20 07:11:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2019-11-20 07:11:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 07:11:29,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 102 states and 190 transitions. [2019-11-20 07:11:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 190 transitions. [2019-11-20 07:11:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 07:11:36,336 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 120 states and 223 transitions. [2019-11-20 07:11:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 223 transitions. [2019-11-20 07:11:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 07:11:44,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:49,310 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-20 07:11:50,073 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-20 07:11:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 127 states and 238 transitions. [2019-11-20 07:11:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 238 transitions. [2019-11-20 07:11:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 07:11:52,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:11:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:11:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 132 states and 248 transitions. [2019-11-20 07:11:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 248 transitions. [2019-11-20 07:11:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 07:11:55,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:11:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:11:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 134 states and 253 transitions. [2019-11-20 07:12:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 253 transitions. [2019-11-20 07:12:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 07:12:01,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 139 states and 266 transitions. [2019-11-20 07:12:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 266 transitions. [2019-11-20 07:12:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 07:12:04,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:09,264 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-11-20 07:12:10,129 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-20 07:12:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 154 states and 314 transitions. [2019-11-20 07:12:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 314 transitions. [2019-11-20 07:12:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 07:12:17,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:22,446 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-11-20 07:12:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 166 states and 338 transitions. [2019-11-20 07:12:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 338 transitions. [2019-11-20 07:12:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 07:12:28,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 167 states and 340 transitions. [2019-11-20 07:12:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 340 transitions. [2019-11-20 07:12:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 07:12:29,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 168 states and 342 transitions. [2019-11-20 07:12:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 342 transitions. [2019-11-20 07:12:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:12:30,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 179 states and 365 transitions. [2019-11-20 07:12:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 365 transitions. [2019-11-20 07:12:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:12:40,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 180 states and 368 transitions. [2019-11-20 07:12:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 368 transitions. [2019-11-20 07:12:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:12:41,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 181 states and 371 transitions. [2019-11-20 07:12:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 371 transitions. [2019-11-20 07:12:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:12:42,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 182 states and 373 transitions. [2019-11-20 07:12:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 373 transitions. [2019-11-20 07:12:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 07:12:43,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 198 states and 413 transitions. [2019-11-20 07:12:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 413 transitions. [2019-11-20 07:12:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 07:12:56,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:12:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:12:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 201 states and 424 transitions. [2019-11-20 07:12:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 424 transitions. [2019-11-20 07:12:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 07:12:59,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:12:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:12:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 202 states and 427 transitions. [2019-11-20 07:13:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 427 transitions. [2019-11-20 07:13:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 07:13:00,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:03,398 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 13 [2019-11-20 07:13:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 211 states and 453 transitions. [2019-11-20 07:13:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 453 transitions. [2019-11-20 07:13:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 07:13:14,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 214 states and 464 transitions. [2019-11-20 07:13:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 464 transitions. [2019-11-20 07:13:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 07:13:17,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 218 states and 476 transitions. [2019-11-20 07:13:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 476 transitions. [2019-11-20 07:13:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:13:20,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 221 states and 487 transitions. [2019-11-20 07:13:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 487 transitions. [2019-11-20 07:13:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:13:25,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 226 states and 500 transitions. [2019-11-20 07:13:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 500 transitions. [2019-11-20 07:13:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:13:29,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 230 states and 512 transitions. [2019-11-20 07:13:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 512 transitions. [2019-11-20 07:13:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:13:32,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 233 states and 522 transitions. [2019-11-20 07:13:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 522 transitions. [2019-11-20 07:13:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 07:13:34,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 235 states and 530 transitions. [2019-11-20 07:13:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 530 transitions. [2019-11-20 07:13:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 07:13:45,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 239 states and 544 transitions. [2019-11-20 07:13:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 544 transitions. [2019-11-20 07:13:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 07:13:49,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 244 states and 557 transitions. [2019-11-20 07:13:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 557 transitions. [2019-11-20 07:13:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 07:13:53,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:13:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:13:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 07:13:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 247 states and 568 transitions. [2019-11-20 07:13:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 568 transitions. [2019-11-20 07:13:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 07:13:56,367 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 07:13:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:13:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:13:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:13:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:13:59,533 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2019-11-20 07:13:59,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 07:13:59 ImpRootNode [2019-11-20 07:13:59,761 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 07:13:59,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:13:59,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:13:59,762 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:13:59,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:07" (3/4) ... [2019-11-20 07:13:59,765 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:13:59,988 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2697860b-e9d0-49fe-ad47-1b12482413af/bin/ukojak/witness.graphml [2019-11-20 07:13:59,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:13:59,990 INFO L168 Benchmark]: Toolchain (without parser) took 175558.08 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -217.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 07:13:59,990 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:13:59,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:13:59,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.03 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:13:59,991 INFO L168 Benchmark]: Boogie Preprocessor took 85.32 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. [2019-11-20 07:13:59,992 INFO L168 Benchmark]: RCFGBuilder took 2870.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 802.3 MB in the end (delta: 309.9 MB). Peak memory consumption was 309.9 MB. Max. memory is 11.5 GB. [2019-11-20 07:13:59,992 INFO L168 Benchmark]: CodeCheck took 171814.43 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 802.3 MB in the beginning and 1.2 GB in the end (delta: -371.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-20 07:13:59,992 INFO L168 Benchmark]: Witness Printer took 226.89 ms. Allocated memory is still 2.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-20 07:13:59,995 INFO L335 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, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 171.5s, OverallIterations: 41, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, 585172568 SDslu, 0 SDs, 0 SdLazy, -1742191944 SolverSat, -1900444116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 94.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12477 GetRequests, 10952 SyntacticMatches, 585 SemanticMatches, 940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540406 ImplicationChecksByTransitivity, 151.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 1134 NumberOfCodeBlocks, 1134 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1049 ConstructedInterpolants, 0 QuantifiedInterpolants, 487966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 130/700 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 586]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L508] int c1 ; [L509] int i2 ; [L512] c1 = 0 [L513] ep12 = __VERIFIER_nondet_bool() [L514] ep13 = __VERIFIER_nondet_bool() [L515] ep21 = __VERIFIER_nondet_bool() [L516] ep23 = __VERIFIER_nondet_bool() [L517] ep31 = __VERIFIER_nondet_bool() [L518] ep32 = __VERIFIER_nondet_bool() [L519] id1 = __VERIFIER_nondet_char() [L520] r1 = __VERIFIER_nondet_uchar() [L521] st1 = __VERIFIER_nondet_char() [L522] nl1 = __VERIFIER_nondet_char() [L523] m1 = __VERIFIER_nondet_char() [L524] max1 = __VERIFIER_nondet_char() [L525] mode1 = __VERIFIER_nondet_bool() [L526] id2 = __VERIFIER_nondet_char() [L527] r2 = __VERIFIER_nondet_uchar() [L528] st2 = __VERIFIER_nondet_char() [L529] nl2 = __VERIFIER_nondet_char() [L530] m2 = __VERIFIER_nondet_char() [L531] max2 = __VERIFIER_nondet_char() [L532] mode2 = __VERIFIER_nondet_bool() [L533] id3 = __VERIFIER_nondet_char() [L534] r3 = __VERIFIER_nondet_uchar() [L535] st3 = __VERIFIER_nondet_char() [L536] nl3 = __VERIFIER_nondet_char() [L537] m3 = __VERIFIER_nondet_char() [L538] max3 = __VERIFIER_nondet_char() [L539] mode3 = __VERIFIER_nondet_bool() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND FALSE !(\read(r121)) [L287] COND FALSE !(\read(r131)) [L294] tmp = 0 [L296] r122 = (_Bool )tmp [L297] COND FALSE !(\read(r131)) [L300] COND FALSE !(\read(r121)) [L307] tmp___0 = 0 [L309] r132 = (_Bool )tmp___0 [L310] COND TRUE \read(r211) [L311] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND TRUE \read(r231) [L324] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND FALSE !(\read(r311)) [L339] COND FALSE !(\read(r321)) [L346] tmp___3 = 0 [L348] r312 = (_Bool )tmp___3 [L349] COND FALSE !(\read(r321)) [L352] COND FALSE !(\read(r311)) [L359] tmp___4 = 0 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE (int )max1 == (int )id1 [L372] COND TRUE (int )max2 == (int )id2 [L373] COND TRUE (int )max3 == (int )id3 [L374] COND TRUE (int )st1 == 0 [L375] COND TRUE (int )st2 == 0 [L376] COND TRUE (int )st3 == 0 [L377] COND TRUE (int )nl1 == 0 [L378] COND TRUE (int )nl2 == 0 [L379] COND TRUE (int )nl3 == 0 [L380] COND TRUE (int )mode1 == 0 [L381] COND TRUE (int )mode2 == 0 [L382] COND TRUE (int )mode3 == 0 [L383] tmp___5 = 1 [L447] return (tmp___5); [L540] i2 = init() [L542] p12_old = nomsg [L543] p12_new = nomsg [L544] p13_old = nomsg [L545] p13_new = nomsg [L546] p21_old = nomsg [L547] p21_new = nomsg [L548] p23_old = nomsg [L549] p23_new = nomsg [L550] p31_old = nomsg [L551] p31_new = nomsg [L552] p32_old = nomsg [L553] p32_new = nomsg [L554] i2 = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L555] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND FALSE !(\read(ep13)) [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND TRUE \read(ep23) [L200] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND FALSE !(\read(ep31)) [L245] COND FALSE !(\read(ep32)) [L249] mode3 = (_Bool)1 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] return (tmp); [L572] c1 = check() [L584] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=2, m3=126, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L555] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L133] COND FALSE !(\read(ep31)) [L140] COND FALSE !((int )r1 == 2) [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND FALSE !(\read(ep32)) [L186] COND FALSE !((int )r2 == 2) [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND FALSE !((int )r3 == 2) [L239] mode3 = (_Bool)0 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] return (tmp); [L572] c1 = check() [L584] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L555] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND FALSE !(\read(ep13)) [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND TRUE \read(ep23) [L200] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND FALSE !(\read(ep31)) [L245] COND FALSE !(\read(ep32)) [L249] mode3 = (_Bool)1 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] return (tmp); [L572] c1 = check() [L584] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=125, p23=0, p23_new=-1, p23_old=125, 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] [L555] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L133] COND FALSE !(\read(ep31)) [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] nl1 = (char)1 [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND FALSE !(\read(ep32)) [L186] COND TRUE (int )r2 == 2 [L187] COND TRUE (int )max2 == (int )id2 [L188] st2 = (char)1 [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] mode3 = (_Bool)0 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L455] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L501] tmp = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L503] return (tmp); [L572] c1 = check() [L584] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L586] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=0, ep32=0, id1=124, id2=125, id3=127, m1=125, m2=2, m3=125, max1=125, max2=125, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.03 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.32 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 2870.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 802.3 MB in the end (delta: 309.9 MB). Peak memory consumption was 309.9 MB. Max. memory is 11.5 GB. * CodeCheck took 171814.43 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 802.3 MB in the beginning and 1.2 GB in the end (delta: -371.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 226.89 ms. Allocated memory is still 2.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...