./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.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_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/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 00d162608be697d65baff4581155da4ea0225a1e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:23:22,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:23:22,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:23:22,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:23:22,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:23:22,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:23:22,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:23:22,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:23:22,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:23:22,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:23:22,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:23:22,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:23:22,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:23:22,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:23:22,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:23:22,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:23:22,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:23:22,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:23:22,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:23:22,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:23:22,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:23:22,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:23:22,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:23:22,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:23:22,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:23:22,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:23:22,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:23:22,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:23:22,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:23:22,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:23:22,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:23:22,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:23:22,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:23:22,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:23:22,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:23:22,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:23:22,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:23:22,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:23:22,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:23:22,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:23:22,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:23:22,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 05:23:22,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:23:22,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:23:22,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 05:23:22,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 05:23:22,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:23:22,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:23:22,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:23:22,911 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:23:22,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:23:22,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:23:22,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:23:22,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:23:22,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:23:22,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:23:22,912 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:23:22,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:23:22,912 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:23:22,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:23:22,912 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 05:23:22,913 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 05:23:22,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:23:22,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:23:22,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 05:23:22,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:23:22,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:23:22,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:23:22,914 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 05:23:22,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:23:22,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:23:22,915 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_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/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 -> 00d162608be697d65baff4581155da4ea0225a1e [2019-11-20 05:23:23,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:23:23,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:23:23,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:23:23,130 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:23:23,131 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:23:23,133 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-11-20 05:23:23,195 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/data/5cf9fec54/6f3547aa84a34343a5855aa81fc81d10/FLAG19d9c1789 [2019-11-20 05:23:23,634 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:23:23,635 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-11-20 05:23:23,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/data/5cf9fec54/6f3547aa84a34343a5855aa81fc81d10/FLAG19d9c1789 [2019-11-20 05:23:23,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/data/5cf9fec54/6f3547aa84a34343a5855aa81fc81d10 [2019-11-20 05:23:23,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:23:23,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:23:23,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:23:23,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:23:23,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:23:23,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:23:23" (1/1) ... [2019-11-20 05:23:23,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47429033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:23, skipping insertion in model container [2019-11-20 05:23:23,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:23:23" (1/1) ... [2019-11-20 05:23:23,672 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:23:23,713 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:23:24,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:23:24,056 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:23:24,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:23:24,140 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:23:24,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24 WrapperNode [2019-11-20 05:23:24,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:23:24,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:23:24,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:23:24,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:23:24,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:23:24,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:23:24,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:23:24,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:23:24,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... [2019-11-20 05:23:24,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:23:24,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:23:24,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:23:24,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:23:24,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:23:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/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 05:23:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:23:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:23:26,969 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:23:26,970 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 05:23:26,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:23:26 BoogieIcfgContainer [2019-11-20 05:23:26,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:23:26,972 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 05:23:26,972 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 05:23:26,982 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 05:23:26,984 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:23:26" (1/1) ... [2019-11-20 05:23:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:23:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2019-11-20 05:23:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2019-11-20 05:23:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 05:23:27,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:27,511 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 05:23:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2019-11-20 05:23:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2019-11-20 05:23:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 05:23:27,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:27,810 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 05:23:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2019-11-20 05:23:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2019-11-20 05:23:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 05:23:28,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:28,356 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 05:23:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2019-11-20 05:23:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-20 05:23:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 05:23:28,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:29,059 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 05:23:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2019-11-20 05:23:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2019-11-20 05:23:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 05:23:29,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:29,893 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 05:23:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2019-11-20 05:23:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2019-11-20 05:23:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 05:23:30,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:30,926 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 05:23:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2019-11-20 05:23:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2019-11-20 05:23:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:23:31,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:32,001 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 05:23:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2019-11-20 05:23:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2019-11-20 05:23:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 05:23:32,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:32,273 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 05:23:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2019-11-20 05:23:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2019-11-20 05:23:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 05:23:32,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:32,605 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 05:23:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2019-11-20 05:23:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2019-11-20 05:23:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:23:34,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:34,545 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 05:23:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2019-11-20 05:23:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2019-11-20 05:23:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 05:23:34,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:36,145 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 05:23:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 74 states and 135 transitions. [2019-11-20 05:23:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2019-11-20 05:23:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 05:23:40,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:41,161 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 05:23:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 90 states and 165 transitions. [2019-11-20 05:23:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 165 transitions. [2019-11-20 05:23:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 05:23:45,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:46,074 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 05:23:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 91 states and 167 transitions. [2019-11-20 05:23:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 167 transitions. [2019-11-20 05:23:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:23:46,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:47,491 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 05:23:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 104 states and 192 transitions. [2019-11-20 05:23:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 192 transitions. [2019-11-20 05:23:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:23:51,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:52,023 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 05:23:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 105 states and 196 transitions. [2019-11-20 05:23:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 196 transitions. [2019-11-20 05:23:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:23:52,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:52,553 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 05:23:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 106 states and 197 transitions. [2019-11-20 05:23:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 197 transitions. [2019-11-20 05:23:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:23:53,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:53,647 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 05:23:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 119 states and 223 transitions. [2019-11-20 05:23:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 223 transitions. [2019-11-20 05:23:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:23:57,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:58,154 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 05:23:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 120 states and 225 transitions. [2019-11-20 05:23:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 225 transitions. [2019-11-20 05:23:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:23:58,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:58,952 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 05:23:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:23:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 121 states and 226 transitions. [2019-11-20 05:23:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 226 transitions. [2019-11-20 05:23:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:23:59,459 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:23:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:23:59,680 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 05:24:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 122 states and 227 transitions. [2019-11-20 05:24:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 227 transitions. [2019-11-20 05:24:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:24:00,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:00,303 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 05:24:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 123 states and 232 transitions. [2019-11-20 05:24:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 232 transitions. [2019-11-20 05:24:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 05:24:00,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:03,358 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 05:24:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 142 states and 265 transitions. [2019-11-20 05:24:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 265 transitions. [2019-11-20 05:24:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 05:24:11,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:11,495 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 05:24:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 147 states and 274 transitions. [2019-11-20 05:24:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 274 transitions. [2019-11-20 05:24:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 05:24:13,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:14,821 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 05:24:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 154 states and 291 transitions. [2019-11-20 05:24:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 291 transitions. [2019-11-20 05:24:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 05:24:20,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:23,042 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 05:24:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 167 states and 338 transitions. [2019-11-20 05:24:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 338 transitions. [2019-11-20 05:24:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 05:24:31,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:33,294 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 05:24:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 177 states and 354 transitions. [2019-11-20 05:24:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 354 transitions. [2019-11-20 05:24:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 05:24:39,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:40,273 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 05:24:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 178 states and 357 transitions. [2019-11-20 05:24:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 357 transitions. [2019-11-20 05:24:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 05:24:41,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:43,261 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 05:24:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 187 states and 373 transitions. [2019-11-20 05:24:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 373 transitions. [2019-11-20 05:24:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 05:24:50,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:50,343 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 05:24:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 188 states and 377 transitions. [2019-11-20 05:24:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 377 transitions. [2019-11-20 05:24:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 05:24:51,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:51,468 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 05:24:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 189 states and 380 transitions. [2019-11-20 05:24:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 380 transitions. [2019-11-20 05:24:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 05:24:52,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:52,502 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 05:24:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:24:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 190 states and 383 transitions. [2019-11-20 05:24:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 383 transitions. [2019-11-20 05:24:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:24:53,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:24:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 203 states and 415 transitions. [2019-11-20 05:25:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 415 transitions. [2019-11-20 05:25:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:25:03,944 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 204 states and 426 transitions. [2019-11-20 05:25:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 426 transitions. [2019-11-20 05:25:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:25:05,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 205 states and 432 transitions. [2019-11-20 05:25:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 432 transitions. [2019-11-20 05:25:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:25:06,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 206 states and 438 transitions. [2019-11-20 05:25:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 438 transitions. [2019-11-20 05:25:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:25:07,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 207 states and 441 transitions. [2019-11-20 05:25:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 441 transitions. [2019-11-20 05:25:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 05:25:09,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 208 states and 444 transitions. [2019-11-20 05:25:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 444 transitions. [2019-11-20 05:25:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 05:25:11,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 224 states and 487 transitions. [2019-11-20 05:25:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 487 transitions. [2019-11-20 05:25:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 05:25:26,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 225 states and 490 transitions. [2019-11-20 05:25:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 490 transitions. [2019-11-20 05:25:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 05:25:27,109 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 229 states and 505 transitions. [2019-11-20 05:25:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 505 transitions. [2019-11-20 05:25:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 05:25:31,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 230 states and 506 transitions. [2019-11-20 05:25:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 506 transitions. [2019-11-20 05:25:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:25:32,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:33,762 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 05:25:36,228 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-11-20 05:25:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 236 states and 526 transitions. [2019-11-20 05:25:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 526 transitions. [2019-11-20 05:25:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:25:39,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:39,992 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 05:25:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 237 states and 527 transitions. [2019-11-20 05:25:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 527 transitions. [2019-11-20 05:25:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:25:40,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:41,032 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 05:25:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 238 states and 533 transitions. [2019-11-20 05:25:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 533 transitions. [2019-11-20 05:25:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:25:42,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:42,346 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 05:25:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 242 states and 545 transitions. [2019-11-20 05:25:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 545 transitions. [2019-11-20 05:25:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 05:25:45,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:45,985 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 05:25:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 245 states and 556 transitions. [2019-11-20 05:25:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 556 transitions. [2019-11-20 05:25:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:25:48,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:51,378 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 05:25:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 246 states and 561 transitions. [2019-11-20 05:25:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 561 transitions. [2019-11-20 05:25:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:25:53,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 247 states and 565 transitions. [2019-11-20 05:25:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 565 transitions. [2019-11-20 05:25:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:25:55,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:25:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:25:58,905 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-20 05:25:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:25:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 251 states and 581 transitions. [2019-11-20 05:25:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 581 transitions. [2019-11-20 05:25:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:25:59,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:25:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:26:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:26:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 252 states and 582 transitions. [2019-11-20 05:26:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 582 transitions. [2019-11-20 05:26:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:26:02,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:26:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:26:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:26:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 256 states and 598 transitions. [2019-11-20 05:26:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 598 transitions. [2019-11-20 05:26:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:26:06,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:26:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:26:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 05:26:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 259 states and 610 transitions. [2019-11-20 05:26:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 610 transitions. [2019-11-20 05:26:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 05:26:09,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 05:26:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:26:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:26:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:26:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:26:13,594 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 iterations. [2019-11-20 05:26:13,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 05:26:13 ImpRootNode [2019-11-20 05:26:13,792 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 05:26:13,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:26:13,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:26:13,792 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:26:13,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:23:26" (3/4) ... [2019-11-20 05:26:13,798 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:26:13,993 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_caded0e3-dc2b-4673-8bc1-dc85dbdfeb97/bin/ukojak/witness.graphml [2019-11-20 05:26:13,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:26:13,995 INFO L168 Benchmark]: Toolchain (without parser) took 170337.03 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 944.7 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 190.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:26:13,995 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:26:13,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -216.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:26:13,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:26:13,996 INFO L168 Benchmark]: Boogie Preprocessor took 39.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:26:13,996 INFO L168 Benchmark]: RCFGBuilder took 2736.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -35.7 MB). Peak memory consumption was 307.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:26:13,997 INFO L168 Benchmark]: CodeCheck took 166819.35 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:26:13,997 INFO L168 Benchmark]: Witness Printer took 201.36 ms. Allocated memory is still 2.5 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:26:13,999 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: 166.5s, OverallIterations: 53, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -2145903856 SDslu, 0 SDs, 0 SdLazy, 1850607132 SolverSat, 1266811084 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16110 GetRequests, 14252 SyntacticMatches, 930 SemanticMatches, 928 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541154 ImplicationChecksByTransitivity, 147.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 1484 NumberOfCodeBlocks, 1484 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1387 ConstructedInterpolants, 0 QuantifiedInterpolants, 565888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 10 PerfectInterpolantSequences, 158/927 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: 610]: 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}; [L532] int c1 ; [L533] int i2 ; [L536] c1 = 0 [L537] ep12 = __VERIFIER_nondet_bool() [L538] ep13 = __VERIFIER_nondet_bool() [L539] ep21 = __VERIFIER_nondet_bool() [L540] ep23 = __VERIFIER_nondet_bool() [L541] ep31 = __VERIFIER_nondet_bool() [L542] ep32 = __VERIFIER_nondet_bool() [L543] id1 = __VERIFIER_nondet_char() [L544] r1 = __VERIFIER_nondet_uchar() [L545] st1 = __VERIFIER_nondet_char() [L546] nl1 = __VERIFIER_nondet_char() [L547] m1 = __VERIFIER_nondet_char() [L548] max1 = __VERIFIER_nondet_char() [L549] mode1 = __VERIFIER_nondet_bool() [L550] id2 = __VERIFIER_nondet_char() [L551] r2 = __VERIFIER_nondet_uchar() [L552] st2 = __VERIFIER_nondet_char() [L553] nl2 = __VERIFIER_nondet_char() [L554] m2 = __VERIFIER_nondet_char() [L555] max2 = __VERIFIER_nondet_char() [L556] mode2 = __VERIFIER_nondet_bool() [L557] id3 = __VERIFIER_nondet_char() [L558] r3 = __VERIFIER_nondet_uchar() [L559] st3 = __VERIFIER_nondet_char() [L560] nl3 = __VERIFIER_nondet_char() [L561] m3 = __VERIFIER_nondet_char() [L562] max3 = __VERIFIER_nondet_char() [L563] 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 TRUE \read(r121) [L285] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND FALSE !(\read(r131)) [L300] COND TRUE \read(r121) [L301] COND TRUE \read(ep23) [L302] tmp___0 = 1 [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 TRUE \read(r321) [L340] COND TRUE \read(ep21) [L341] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [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 \read(r122) [L372] COND TRUE \read(r132) [L373] COND TRUE \read(r212) [L374] COND TRUE \read(r232) [L375] COND TRUE \read(r312) [L376] COND TRUE \read(r322) [L377] COND TRUE (int )max1 == (int )id1 [L378] COND TRUE (int )max2 == (int )id2 [L379] COND TRUE (int )max3 == (int )id3 [L380] COND TRUE (int )st1 == 0 [L381] COND TRUE (int )st2 == 0 [L382] COND TRUE (int )st3 == 0 [L383] COND TRUE (int )nl1 == 0 [L384] COND TRUE (int )nl2 == 0 [L385] COND TRUE (int )nl3 == 0 [L386] COND TRUE (int )mode1 == 0 [L387] COND TRUE (int )mode2 == 0 [L388] COND TRUE (int )mode3 == 0 [L389] tmp___5 = 1 [L471] return (tmp___5); [L564] i2 = init() [L566] p12_old = nomsg [L567] p12_new = nomsg [L568] p13_old = nomsg [L569] p13_new = nomsg [L570] p21_old = nomsg [L571] p21_new = nomsg [L572] p23_old = nomsg [L573] p23_new = nomsg [L574] p31_old = nomsg [L575] p31_new = nomsg [L576] p32_old = nomsg [L577] p32_new = nomsg [L578] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, 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] [L579] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND TRUE \read(ep12) [L151] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L151] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [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 TRUE \read(ep32) [L246] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] mode3 = (_Bool)1 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=63, m2=-128, m3=1, max1=62, max2=64, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=62, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L579] 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 TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [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 TRUE (int )m3 > (int )max3 [L229] max3 = m3 [L232] COND FALSE !((int )r3 == 2) [L239] mode3 = (_Bool)0 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, 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] [L579] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND TRUE \read(ep12) [L151] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L151] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [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 TRUE \read(ep32) [L246] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] mode3 = (_Bool)1 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L480] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (int )r1 < 2 [L499] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] return (tmp); [L596] c1 = check() [L608] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=0, m3=64, max1=64, max2=64, max3=64, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=64, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=64, p23=0, p23_new=-1, p23_old=64, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=64, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] 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] st1 = (char)1 [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND TRUE \read(ep12) [L173] m2 = p12_old [L174] p12_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [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 FALSE !((int )max3 == (int )id3) [L236] nl3 = (char)1 [L239] mode3 = (_Bool)0 [L584] p12_old = p12_new [L585] p12_new = nomsg [L586] p13_old = p13_new [L587] p13_new = nomsg [L588] p21_old = p21_new [L589] p21_new = nomsg [L590] p23_old = p23_new [L591] p23_new = nomsg [L592] p31_old = p31_new [L593] p31_new = nomsg [L594] p32_old = p32_new [L595] p32_new = nomsg [L476] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=64, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=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] [L479] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L525] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=64, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=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] [L527] return (tmp); [L596] c1 = check() [L608] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=64, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=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] [L610] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=0, ep32=1, id1=62, id2=64, id3=0, m1=64, m2=64, m3=64, max1=64, max2=64, max3=64, mode1=0, mode2=0, mode3=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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 482.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -216.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2736.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.6 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -35.7 MB). Peak memory consumption was 307.9 MB. Max. memory is 11.5 GB. * CodeCheck took 166819.35 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. * Witness Printer took 201.36 ms. Allocated memory is still 2.5 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...