./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6bcb7c43ff429bb3ec192ecdc221aceafde1427 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 10:27:26,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:27:26,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:27:26,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:27:26,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:27:26,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:27:26,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:27:26,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:27:26,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:27:26,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:27:26,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:27:26,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:27:26,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:27:26,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:27:26,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:27:26,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:27:26,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:27:26,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:27:26,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:27:26,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:27:26,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:27:26,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:27:26,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:27:26,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:27:26,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:27:26,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:27:26,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:27:26,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:27:26,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:27:26,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:27:26,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:27:26,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:27:26,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:27:26,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:27:26,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:27:26,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:27:26,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:27:26,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:27:26,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:27:26,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:27:26,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:27:26,634 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:27:26,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:27:26,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:27:26,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:27:26,645 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:27:26,645 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:27:26,645 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:27:26,645 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:27:26,646 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:27:26,646 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:27:26,646 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:27:26,646 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:27:26,646 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:27:26,646 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:27:26,647 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:27:26,647 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:27:26,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:27:26,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:27:26,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:27:26,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:27:26,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:27:26,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:27:26,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:27:26,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:27:26,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:27:26,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:27:26,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:27:26,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:27:26,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:27:26,650 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:27:26,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:27:26,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:27:26,650 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:27:26,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:27:26,651 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan 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 -> Taipan 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 -> b6bcb7c43ff429bb3ec192ecdc221aceafde1427 [2019-12-07 10:27:26,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:27:26,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:27:26,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:27:26,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:27:26,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:27:26,760 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-12-07 10:27:26,797 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/data/59d57c93f/80aa39a5422842548adc3070e97d367b/FLAG1cb4115af [2019-12-07 10:27:27,278 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:27:27,278 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-12-07 10:27:27,288 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/data/59d57c93f/80aa39a5422842548adc3070e97d367b/FLAG1cb4115af [2019-12-07 10:27:27,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/data/59d57c93f/80aa39a5422842548adc3070e97d367b [2019-12-07 10:27:27,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:27:27,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:27:27,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:27:27,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:27:27,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:27:27,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487eb8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27, skipping insertion in model container [2019-12-07 10:27:27,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:27:27,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:27:27,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:27:27,646 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:27:27,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:27:27,759 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:27:27,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27 WrapperNode [2019-12-07 10:27:27,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:27:27,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:27:27,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:27:27,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:27:27,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:27:27,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:27:27,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:27:27,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:27:27,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... [2019-12-07 10:27:27,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:27:27,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:27:27,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:27:27,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:27:27,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2019-12-07 10:27:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:27:27,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:27:29,228 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:27:29,228 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 10:27:29,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:29 BoogieIcfgContainer [2019-12-07 10:27:29,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:27:29,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:27:29,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:27:29,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:27:29,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:27:27" (1/3) ... [2019-12-07 10:27:29,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f815ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:27:29, skipping insertion in model container [2019-12-07 10:27:29,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:27:27" (2/3) ... [2019-12-07 10:27:29,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f815ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:27:29, skipping insertion in model container [2019-12-07 10:27:29,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:29" (3/3) ... [2019-12-07 10:27:29,234 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-12-07 10:27:29,241 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:27:29,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:27:29,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:27:29,271 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:27:29,271 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:27:29,271 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:27:29,271 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:27:29,272 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:27:29,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:27:29,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:27:29,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:27:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2019-12-07 10:27:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 10:27:29,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:29,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:29,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash -379039266, now seen corresponding path program 1 times [2019-12-07 10:27:29,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:29,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192454639] [2019-12-07 10:27:29,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:29,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192454639] [2019-12-07 10:27:29,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:29,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:29,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313745630] [2019-12-07 10:27:29,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:29,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:29,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:29,835 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 5 states. [2019-12-07 10:27:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:29,944 INFO L93 Difference]: Finished difference Result 612 states and 1071 transitions. [2019-12-07 10:27:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:29,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-12-07 10:27:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:29,959 INFO L225 Difference]: With dead ends: 612 [2019-12-07 10:27:29,959 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 10:27:29,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 10:27:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2019-12-07 10:27:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-12-07 10:27:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 585 transitions. [2019-12-07 10:27:30,026 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 585 transitions. Word has length 118 [2019-12-07 10:27:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:30,027 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 585 transitions. [2019-12-07 10:27:30,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 585 transitions. [2019-12-07 10:27:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 10:27:30,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:30,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:30,031 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:30,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1223742701, now seen corresponding path program 1 times [2019-12-07 10:27:30,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:30,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670220122] [2019-12-07 10:27:30,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:30,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670220122] [2019-12-07 10:27:30,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:30,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:30,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064236783] [2019-12-07 10:27:30,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:30,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:30,106 INFO L87 Difference]: Start difference. First operand 424 states and 585 transitions. Second operand 3 states. [2019-12-07 10:27:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:30,162 INFO L93 Difference]: Finished difference Result 913 states and 1280 transitions. [2019-12-07 10:27:30,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:30,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 10:27:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:30,166 INFO L225 Difference]: With dead ends: 913 [2019-12-07 10:27:30,166 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 10:27:30,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 10:27:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 533. [2019-12-07 10:27:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-12-07 10:27:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 761 transitions. [2019-12-07 10:27:30,195 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 761 transitions. Word has length 120 [2019-12-07 10:27:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:30,196 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 761 transitions. [2019-12-07 10:27:30,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 761 transitions. [2019-12-07 10:27:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 10:27:30,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:30,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:30,198 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:30,199 INFO L82 PathProgramCache]: Analyzing trace with hash -186373524, now seen corresponding path program 1 times [2019-12-07 10:27:30,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:30,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562429446] [2019-12-07 10:27:30,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:30,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562429446] [2019-12-07 10:27:30,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:30,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:30,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376154513] [2019-12-07 10:27:30,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:30,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:30,264 INFO L87 Difference]: Start difference. First operand 533 states and 761 transitions. Second operand 3 states. [2019-12-07 10:27:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:30,348 INFO L93 Difference]: Finished difference Result 1266 states and 1853 transitions. [2019-12-07 10:27:30,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:30,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 10:27:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:30,353 INFO L225 Difference]: With dead ends: 1266 [2019-12-07 10:27:30,353 INFO L226 Difference]: Without dead ends: 794 [2019-12-07 10:27:30,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-12-07 10:27:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 731. [2019-12-07 10:27:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-12-07 10:27:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1081 transitions. [2019-12-07 10:27:30,380 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1081 transitions. Word has length 120 [2019-12-07 10:27:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:30,381 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1081 transitions. [2019-12-07 10:27:30,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1081 transitions. [2019-12-07 10:27:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 10:27:30,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:30,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:30,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash -260899441, now seen corresponding path program 1 times [2019-12-07 10:27:30,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:30,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435004711] [2019-12-07 10:27:30,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:30,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435004711] [2019-12-07 10:27:30,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:30,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:30,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707799163] [2019-12-07 10:27:30,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:30,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:30,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:30,456 INFO L87 Difference]: Start difference. First operand 731 states and 1081 transitions. Second operand 5 states. [2019-12-07 10:27:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:30,595 INFO L93 Difference]: Finished difference Result 1380 states and 2057 transitions. [2019-12-07 10:27:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:30,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-12-07 10:27:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:30,598 INFO L225 Difference]: With dead ends: 1380 [2019-12-07 10:27:30,598 INFO L226 Difference]: Without dead ends: 731 [2019-12-07 10:27:30,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-12-07 10:27:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-12-07 10:27:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-12-07 10:27:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1069 transitions. [2019-12-07 10:27:30,625 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1069 transitions. Word has length 123 [2019-12-07 10:27:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:30,626 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1069 transitions. [2019-12-07 10:27:30,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1069 transitions. [2019-12-07 10:27:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 10:27:30,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:30,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:30,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2083418026, now seen corresponding path program 1 times [2019-12-07 10:27:30,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:30,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862878373] [2019-12-07 10:27:30,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:30,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862878373] [2019-12-07 10:27:30,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:30,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:27:30,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862614256] [2019-12-07 10:27:30,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:27:30,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:30,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:27:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:27:30,873 INFO L87 Difference]: Start difference. First operand 731 states and 1069 transitions. Second operand 6 states. [2019-12-07 10:27:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:30,998 INFO L93 Difference]: Finished difference Result 2034 states and 3001 transitions. [2019-12-07 10:27:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:30,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-12-07 10:27:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:31,004 INFO L225 Difference]: With dead ends: 2034 [2019-12-07 10:27:31,004 INFO L226 Difference]: Without dead ends: 1370 [2019-12-07 10:27:31,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-12-07 10:27:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-12-07 10:27:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-12-07 10:27:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2001 transitions. [2019-12-07 10:27:31,065 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2001 transitions. Word has length 123 [2019-12-07 10:27:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:31,065 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2001 transitions. [2019-12-07 10:27:31,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:27:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2001 transitions. [2019-12-07 10:27:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 10:27:31,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:31,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:31,067 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash -558488554, now seen corresponding path program 1 times [2019-12-07 10:27:31,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:31,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672586449] [2019-12-07 10:27:31,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:31,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672586449] [2019-12-07 10:27:31,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:31,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:31,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299159629] [2019-12-07 10:27:31,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:31,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:31,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:31,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:31,112 INFO L87 Difference]: Start difference. First operand 1368 states and 2001 transitions. Second operand 3 states. [2019-12-07 10:27:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:31,261 INFO L93 Difference]: Finished difference Result 3560 states and 5319 transitions. [2019-12-07 10:27:31,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:31,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-12-07 10:27:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:31,271 INFO L225 Difference]: With dead ends: 3560 [2019-12-07 10:27:31,271 INFO L226 Difference]: Without dead ends: 2232 [2019-12-07 10:27:31,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2019-12-07 10:27:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2064. [2019-12-07 10:27:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2019-12-07 10:27:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 3111 transitions. [2019-12-07 10:27:31,357 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 3111 transitions. Word has length 125 [2019-12-07 10:27:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:31,357 INFO L462 AbstractCegarLoop]: Abstraction has 2064 states and 3111 transitions. [2019-12-07 10:27:31,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 3111 transitions. [2019-12-07 10:27:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-07 10:27:31,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:31,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:31,359 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash -95286276, now seen corresponding path program 1 times [2019-12-07 10:27:31,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:31,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369821305] [2019-12-07 10:27:31,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:31,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369821305] [2019-12-07 10:27:31,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:31,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:31,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105476868] [2019-12-07 10:27:31,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:31,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:31,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:31,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:31,415 INFO L87 Difference]: Start difference. First operand 2064 states and 3111 transitions. Second operand 3 states. [2019-12-07 10:27:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:31,545 INFO L93 Difference]: Finished difference Result 3941 states and 5976 transitions. [2019-12-07 10:27:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:31,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-12-07 10:27:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:31,557 INFO L225 Difference]: With dead ends: 3941 [2019-12-07 10:27:31,557 INFO L226 Difference]: Without dead ends: 3038 [2019-12-07 10:27:31,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2019-12-07 10:27:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 3036. [2019-12-07 10:27:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2019-12-07 10:27:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4537 transitions. [2019-12-07 10:27:31,674 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4537 transitions. Word has length 128 [2019-12-07 10:27:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:31,675 INFO L462 AbstractCegarLoop]: Abstraction has 3036 states and 4537 transitions. [2019-12-07 10:27:31,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4537 transitions. [2019-12-07 10:27:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-07 10:27:31,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:31,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:31,676 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1847111175, now seen corresponding path program 1 times [2019-12-07 10:27:31,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:31,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726791197] [2019-12-07 10:27:31,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:31,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726791197] [2019-12-07 10:27:31,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:31,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:31,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232549037] [2019-12-07 10:27:31,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:31,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:31,758 INFO L87 Difference]: Start difference. First operand 3036 states and 4537 transitions. Second operand 5 states. [2019-12-07 10:27:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:31,987 INFO L93 Difference]: Finished difference Result 6034 states and 9033 transitions. [2019-12-07 10:27:31,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:31,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-12-07 10:27:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:31,999 INFO L225 Difference]: With dead ends: 6034 [2019-12-07 10:27:31,999 INFO L226 Difference]: Without dead ends: 3036 [2019-12-07 10:27:32,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2019-12-07 10:27:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 3036. [2019-12-07 10:27:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2019-12-07 10:27:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4485 transitions. [2019-12-07 10:27:32,128 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4485 transitions. Word has length 128 [2019-12-07 10:27:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:32,128 INFO L462 AbstractCegarLoop]: Abstraction has 3036 states and 4485 transitions. [2019-12-07 10:27:32,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4485 transitions. [2019-12-07 10:27:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-07 10:27:32,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:32,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:32,130 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1034419458, now seen corresponding path program 1 times [2019-12-07 10:27:32,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:32,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125477854] [2019-12-07 10:27:32,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:32,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125477854] [2019-12-07 10:27:32,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:32,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:32,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496672887] [2019-12-07 10:27:32,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:32,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:32,320 INFO L87 Difference]: Start difference. First operand 3036 states and 4485 transitions. Second operand 5 states. [2019-12-07 10:27:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:32,536 INFO L93 Difference]: Finished difference Result 3999 states and 5920 transitions. [2019-12-07 10:27:32,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:32,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-12-07 10:27:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:32,551 INFO L225 Difference]: With dead ends: 3999 [2019-12-07 10:27:32,551 INFO L226 Difference]: Without dead ends: 3043 [2019-12-07 10:27:32,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2019-12-07 10:27:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 3032. [2019-12-07 10:27:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3032 states. [2019-12-07 10:27:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 4480 transitions. [2019-12-07 10:27:32,763 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 4480 transitions. Word has length 128 [2019-12-07 10:27:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:32,764 INFO L462 AbstractCegarLoop]: Abstraction has 3032 states and 4480 transitions. [2019-12-07 10:27:32,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4480 transitions. [2019-12-07 10:27:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-07 10:27:32,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:32,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:32,766 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1547191634, now seen corresponding path program 1 times [2019-12-07 10:27:32,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:32,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054240119] [2019-12-07 10:27:32,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:32,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054240119] [2019-12-07 10:27:32,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:32,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:32,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474893006] [2019-12-07 10:27:32,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:32,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:32,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:32,951 INFO L87 Difference]: Start difference. First operand 3032 states and 4480 transitions. Second operand 5 states. [2019-12-07 10:27:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:33,252 INFO L93 Difference]: Finished difference Result 8186 states and 12115 transitions. [2019-12-07 10:27:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:33,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-12-07 10:27:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:33,274 INFO L225 Difference]: With dead ends: 8186 [2019-12-07 10:27:33,274 INFO L226 Difference]: Without dead ends: 5313 [2019-12-07 10:27:33,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-12-07 10:27:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5311. [2019-12-07 10:27:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-12-07 10:27:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 7767 transitions. [2019-12-07 10:27:33,538 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 7767 transitions. Word has length 128 [2019-12-07 10:27:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:33,538 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 7767 transitions. [2019-12-07 10:27:33,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 7767 transitions. [2019-12-07 10:27:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:27:33,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:33,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:33,541 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2075429958, now seen corresponding path program 1 times [2019-12-07 10:27:33,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:33,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809626702] [2019-12-07 10:27:33,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:34,561 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-07 10:27:34,716 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-12-07 10:27:34,870 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-12-07 10:27:35,043 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-12-07 10:27:35,231 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-12-07 10:27:35,524 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-12-07 10:27:35,824 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 76 [2019-12-07 10:27:36,101 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81 [2019-12-07 10:27:36,343 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 69 [2019-12-07 10:27:36,554 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 59 [2019-12-07 10:27:36,781 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2019-12-07 10:27:37,139 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-12-07 10:27:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:37,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809626702] [2019-12-07 10:27:37,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:37,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-12-07 10:27:37,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603329810] [2019-12-07 10:27:37,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 10:27:37,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 10:27:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:27:37,497 INFO L87 Difference]: Start difference. First operand 5311 states and 7767 transitions. Second operand 28 states. [2019-12-07 10:27:38,233 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-12-07 10:27:38,462 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-12-07 10:27:38,697 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 75 [2019-12-07 10:27:39,272 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 80 [2019-12-07 10:27:39,652 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 88 [2019-12-07 10:27:40,032 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 103 [2019-12-07 10:27:40,395 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 107 [2019-12-07 10:27:41,066 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 111 [2019-12-07 10:27:41,485 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 116 [2019-12-07 10:27:42,028 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 130 [2019-12-07 10:27:44,642 WARN L192 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 202 DAG size of output: 134 [2019-12-07 10:27:44,929 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2019-12-07 10:27:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:46,874 INFO L93 Difference]: Finished difference Result 7715 states and 11122 transitions. [2019-12-07 10:27:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 10:27:46,875 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 133 [2019-12-07 10:27:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:46,898 INFO L225 Difference]: With dead ends: 7715 [2019-12-07 10:27:46,898 INFO L226 Difference]: Without dead ends: 6069 [2019-12-07 10:27:46,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=426, Invalid=1466, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 10:27:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2019-12-07 10:27:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 5405. [2019-12-07 10:27:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-12-07 10:27:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7881 transitions. [2019-12-07 10:27:47,170 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7881 transitions. Word has length 133 [2019-12-07 10:27:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:47,170 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 7881 transitions. [2019-12-07 10:27:47,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 10:27:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7881 transitions. [2019-12-07 10:27:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:27:47,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:47,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:47,173 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash -187540255, now seen corresponding path program 1 times [2019-12-07 10:27:47,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:47,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943229656] [2019-12-07 10:27:47,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:47,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943229656] [2019-12-07 10:27:47,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:47,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:47,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842199746] [2019-12-07 10:27:47,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:47,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:47,236 INFO L87 Difference]: Start difference. First operand 5405 states and 7881 transitions. Second operand 5 states. [2019-12-07 10:27:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:47,528 INFO L93 Difference]: Finished difference Result 10629 states and 15536 transitions. [2019-12-07 10:27:47,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:47,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-12-07 10:27:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:47,536 INFO L225 Difference]: With dead ends: 10629 [2019-12-07 10:27:47,536 INFO L226 Difference]: Without dead ends: 5405 [2019-12-07 10:27:47,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:27:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-12-07 10:27:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 5405. [2019-12-07 10:27:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2019-12-07 10:27:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7777 transitions. [2019-12-07 10:27:47,760 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7777 transitions. Word has length 133 [2019-12-07 10:27:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:47,760 INFO L462 AbstractCegarLoop]: Abstraction has 5405 states and 7777 transitions. [2019-12-07 10:27:47,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7777 transitions. [2019-12-07 10:27:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:27:47,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:47,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:47,763 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:47,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash -16943782, now seen corresponding path program 1 times [2019-12-07 10:27:47,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:47,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515472193] [2019-12-07 10:27:47,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:48,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-12-07 10:27:48,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515472193] [2019-12-07 10:27:48,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:48,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 10:27:48,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861117411] [2019-12-07 10:27:48,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 10:27:48,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 10:27:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:27:48,513 INFO L87 Difference]: Start difference. First operand 5405 states and 7777 transitions. Second operand 20 states. [2019-12-07 10:27:49,483 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-12-07 10:27:49,633 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-07 10:27:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:50,766 INFO L93 Difference]: Finished difference Result 7682 states and 10949 transitions. [2019-12-07 10:27:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:27:50,767 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 133 [2019-12-07 10:27:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:50,774 INFO L225 Difference]: With dead ends: 7682 [2019-12-07 10:27:50,774 INFO L226 Difference]: Without dead ends: 6036 [2019-12-07 10:27:50,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 10:27:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2019-12-07 10:27:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 5578. [2019-12-07 10:27:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5578 states. [2019-12-07 10:27:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 7984 transitions. [2019-12-07 10:27:51,042 INFO L78 Accepts]: Start accepts. Automaton has 5578 states and 7984 transitions. Word has length 133 [2019-12-07 10:27:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:51,043 INFO L462 AbstractCegarLoop]: Abstraction has 5578 states and 7984 transitions. [2019-12-07 10:27:51,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 10:27:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5578 states and 7984 transitions. [2019-12-07 10:27:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:27:51,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:51,045 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:51,045 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1802035417, now seen corresponding path program 1 times [2019-12-07 10:27:51,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:51,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843240856] [2019-12-07 10:27:51,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:51,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843240856] [2019-12-07 10:27:51,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:51,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:27:51,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703426081] [2019-12-07 10:27:51,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:27:51,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:51,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:27:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:51,100 INFO L87 Difference]: Start difference. First operand 5578 states and 7984 transitions. Second operand 3 states. [2019-12-07 10:27:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:51,575 INFO L93 Difference]: Finished difference Result 10675 states and 15451 transitions. [2019-12-07 10:27:51,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:27:51,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-12-07 10:27:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:51,587 INFO L225 Difference]: With dead ends: 10675 [2019-12-07 10:27:51,587 INFO L226 Difference]: Without dead ends: 8052 [2019-12-07 10:27:51,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:27:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8052 states. [2019-12-07 10:27:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8052 to 8050. [2019-12-07 10:27:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8050 states. [2019-12-07 10:27:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 11447 transitions. [2019-12-07 10:27:51,985 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 11447 transitions. Word has length 133 [2019-12-07 10:27:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:51,985 INFO L462 AbstractCegarLoop]: Abstraction has 8050 states and 11447 transitions. [2019-12-07 10:27:51,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:27:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 11447 transitions. [2019-12-07 10:27:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:27:51,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:51,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:51,988 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2040550504, now seen corresponding path program 1 times [2019-12-07 10:27:51,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:51,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926332104] [2019-12-07 10:27:51,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:52,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926332104] [2019-12-07 10:27:52,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:52,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:27:52,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813018337] [2019-12-07 10:27:52,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:27:52,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:52,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:27:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:52,167 INFO L87 Difference]: Start difference. First operand 8050 states and 11447 transitions. Second operand 5 states. [2019-12-07 10:27:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:27:52,550 INFO L93 Difference]: Finished difference Result 11728 states and 16915 transitions. [2019-12-07 10:27:52,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:27:52,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-12-07 10:27:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:27:52,558 INFO L225 Difference]: With dead ends: 11728 [2019-12-07 10:27:52,558 INFO L226 Difference]: Without dead ends: 7254 [2019-12-07 10:27:52,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:27:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-12-07 10:27:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 7252. [2019-12-07 10:27:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7252 states. [2019-12-07 10:27:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 10313 transitions. [2019-12-07 10:27:52,947 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 10313 transitions. Word has length 133 [2019-12-07 10:27:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:27:52,947 INFO L462 AbstractCegarLoop]: Abstraction has 7252 states and 10313 transitions. [2019-12-07 10:27:52,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:27:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 10313 transitions. [2019-12-07 10:27:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 10:27:52,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:27:52,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:27:52,949 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:27:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:27:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2136917192, now seen corresponding path program 1 times [2019-12-07 10:27:52,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:27:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119597468] [2019-12-07 10:27:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:27:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:27:54,955 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-07 10:27:55,172 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2019-12-07 10:27:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:27:55,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119597468] [2019-12-07 10:27:55,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:27:55,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-12-07 10:27:55,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677451403] [2019-12-07 10:27:55,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 10:27:55,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:27:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 10:27:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:27:55,532 INFO L87 Difference]: Start difference. First operand 7252 states and 10313 transitions. Second operand 28 states. [2019-12-07 10:27:56,079 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-07 10:27:56,468 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 10:27:56,999 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-07 10:27:57,467 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-12-07 10:27:57,751 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-12-07 10:27:58,125 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-12-07 10:27:58,420 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 10:27:58,745 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-12-07 10:27:59,513 WARN L192 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-12-07 10:27:59,996 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2019-12-07 10:28:00,401 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 107 [2019-12-07 10:28:01,161 WARN L192 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 112 [2019-12-07 10:28:01,639 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 116 [2019-12-07 10:28:02,229 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-12-07 10:28:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:05,515 INFO L93 Difference]: Finished difference Result 9617 states and 13564 transitions. [2019-12-07 10:28:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 10:28:05,516 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 133 [2019-12-07 10:28:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:05,523 INFO L225 Difference]: With dead ends: 9617 [2019-12-07 10:28:05,523 INFO L226 Difference]: Without dead ends: 7971 [2019-12-07 10:28:05,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=423, Invalid=1469, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 10:28:05,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7971 states. [2019-12-07 10:28:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7971 to 7350. [2019-12-07 10:28:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-12-07 10:28:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 10430 transitions. [2019-12-07 10:28:05,897 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 10430 transitions. Word has length 133 [2019-12-07 10:28:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:05,898 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 10430 transitions. [2019-12-07 10:28:05,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 10:28:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 10430 transitions. [2019-12-07 10:28:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:28:05,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:05,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:05,900 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1423187648, now seen corresponding path program 1 times [2019-12-07 10:28:05,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:28:05,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669795305] [2019-12-07 10:28:05,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:28:05,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669795305] [2019-12-07 10:28:05,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:05,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:05,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662537675] [2019-12-07 10:28:05,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:05,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:28:05,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:05,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:05,933 INFO L87 Difference]: Start difference. First operand 7350 states and 10430 transitions. Second operand 3 states. [2019-12-07 10:28:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:06,427 INFO L93 Difference]: Finished difference Result 12626 states and 18007 transitions. [2019-12-07 10:28:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:06,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 10:28:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:06,432 INFO L225 Difference]: With dead ends: 12626 [2019-12-07 10:28:06,432 INFO L226 Difference]: Without dead ends: 7382 [2019-12-07 10:28:06,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-07 10:28:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7282. [2019-12-07 10:28:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7282 states. [2019-12-07 10:28:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7282 states to 7282 states and 10291 transitions. [2019-12-07 10:28:06,802 INFO L78 Accepts]: Start accepts. Automaton has 7282 states and 10291 transitions. Word has length 134 [2019-12-07 10:28:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:06,802 INFO L462 AbstractCegarLoop]: Abstraction has 7282 states and 10291 transitions. [2019-12-07 10:28:06,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 7282 states and 10291 transitions. [2019-12-07 10:28:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:28:06,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:06,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:06,805 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash 826564102, now seen corresponding path program 1 times [2019-12-07 10:28:06,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:28:06,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294161895] [2019-12-07 10:28:06,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:28:06,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294161895] [2019-12-07 10:28:06,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:06,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:06,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871982580] [2019-12-07 10:28:06,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:06,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:28:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:06,834 INFO L87 Difference]: Start difference. First operand 7282 states and 10291 transitions. Second operand 3 states. [2019-12-07 10:28:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:07,374 INFO L93 Difference]: Finished difference Result 15320 states and 21581 transitions. [2019-12-07 10:28:07,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:07,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 10:28:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:07,380 INFO L225 Difference]: With dead ends: 15320 [2019-12-07 10:28:07,380 INFO L226 Difference]: Without dead ends: 8350 [2019-12-07 10:28:07,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8350 states. [2019-12-07 10:28:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8350 to 7207. [2019-12-07 10:28:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7207 states. [2019-12-07 10:28:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7207 states to 7207 states and 10140 transitions. [2019-12-07 10:28:07,860 INFO L78 Accepts]: Start accepts. Automaton has 7207 states and 10140 transitions. Word has length 134 [2019-12-07 10:28:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:07,861 INFO L462 AbstractCegarLoop]: Abstraction has 7207 states and 10140 transitions. [2019-12-07 10:28:07,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7207 states and 10140 transitions. [2019-12-07 10:28:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:28:07,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:07,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:07,863 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1499349788, now seen corresponding path program 1 times [2019-12-07 10:28:07,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:28:07,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053595978] [2019-12-07 10:28:07,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:07,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-12-07 10:28:07,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053595978] [2019-12-07 10:28:07,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:07,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:07,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609305216] [2019-12-07 10:28:07,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:07,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:28:07,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:07,894 INFO L87 Difference]: Start difference. First operand 7207 states and 10140 transitions. Second operand 3 states. [2019-12-07 10:28:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:08,495 INFO L93 Difference]: Finished difference Result 13157 states and 18541 transitions. [2019-12-07 10:28:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:08,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 10:28:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:08,501 INFO L225 Difference]: With dead ends: 13157 [2019-12-07 10:28:08,502 INFO L226 Difference]: Without dead ends: 8322 [2019-12-07 10:28:08,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-07 10:28:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 7093. [2019-12-07 10:28:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7093 states. [2019-12-07 10:28:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 9963 transitions. [2019-12-07 10:28:08,895 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 9963 transitions. Word has length 134 [2019-12-07 10:28:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:08,896 INFO L462 AbstractCegarLoop]: Abstraction has 7093 states and 9963 transitions. [2019-12-07 10:28:08,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 9963 transitions. [2019-12-07 10:28:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:28:08,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:08,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:08,898 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash -140317297, now seen corresponding path program 1 times [2019-12-07 10:28:08,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:28:08,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059722387] [2019-12-07 10:28:08,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:08,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-12-07 10:28:08,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059722387] [2019-12-07 10:28:08,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:08,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:08,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381798271] [2019-12-07 10:28:08,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:08,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:28:08,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:08,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:08,927 INFO L87 Difference]: Start difference. First operand 7093 states and 9963 transitions. Second operand 3 states. [2019-12-07 10:28:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:09,393 INFO L93 Difference]: Finished difference Result 11936 states and 16746 transitions. [2019-12-07 10:28:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:09,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 10:28:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:09,398 INFO L225 Difference]: With dead ends: 11936 [2019-12-07 10:28:09,398 INFO L226 Difference]: Without dead ends: 7515 [2019-12-07 10:28:09,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2019-12-07 10:28:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 6918. [2019-12-07 10:28:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6918 states. [2019-12-07 10:28:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 9711 transitions. [2019-12-07 10:28:09,800 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 9711 transitions. Word has length 134 [2019-12-07 10:28:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:09,800 INFO L462 AbstractCegarLoop]: Abstraction has 6918 states and 9711 transitions. [2019-12-07 10:28:09,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 9711 transitions. [2019-12-07 10:28:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:28:09,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:09,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:09,802 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash 22503277, now seen corresponding path program 1 times [2019-12-07 10:28:09,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:28:09,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214424454] [2019-12-07 10:28:09,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:28:09,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214424454] [2019-12-07 10:28:09,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:09,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:09,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290812229] [2019-12-07 10:28:09,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:09,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:28:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:09,830 INFO L87 Difference]: Start difference. First operand 6918 states and 9711 transitions. Second operand 3 states. [2019-12-07 10:28:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:10,274 INFO L93 Difference]: Finished difference Result 11110 states and 15576 transitions. [2019-12-07 10:28:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:10,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 10:28:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:10,279 INFO L225 Difference]: With dead ends: 11110 [2019-12-07 10:28:10,280 INFO L226 Difference]: Without dead ends: 7030 [2019-12-07 10:28:10,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7030 states. [2019-12-07 10:28:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7030 to 6869. [2019-12-07 10:28:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6869 states. [2019-12-07 10:28:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6869 states to 6869 states and 9612 transitions. [2019-12-07 10:28:10,661 INFO L78 Accepts]: Start accepts. Automaton has 6869 states and 9612 transitions. Word has length 134 [2019-12-07 10:28:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:10,661 INFO L462 AbstractCegarLoop]: Abstraction has 6869 states and 9612 transitions. [2019-12-07 10:28:10,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6869 states and 9612 transitions. [2019-12-07 10:28:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 10:28:10,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:10,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:10,663 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 986429077, now seen corresponding path program 1 times [2019-12-07 10:28:10,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:28:10,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104437673] [2019-12-07 10:28:10,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:28:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:28:10,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104437673] [2019-12-07 10:28:10,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:28:10,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:28:10,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013222904] [2019-12-07 10:28:10,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:28:10,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:28:10,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:28:10,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:10,688 INFO L87 Difference]: Start difference. First operand 6869 states and 9612 transitions. Second operand 3 states. [2019-12-07 10:28:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:28:11,213 INFO L93 Difference]: Finished difference Result 12258 states and 17076 transitions. [2019-12-07 10:28:11,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:28:11,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 10:28:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:28:11,218 INFO L225 Difference]: With dead ends: 12258 [2019-12-07 10:28:11,219 INFO L226 Difference]: Without dead ends: 7973 [2019-12-07 10:28:11,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:28:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7973 states. [2019-12-07 10:28:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7973 to 6806. [2019-12-07 10:28:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6806 states. [2019-12-07 10:28:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6806 states to 6806 states and 9499 transitions. [2019-12-07 10:28:11,670 INFO L78 Accepts]: Start accepts. Automaton has 6806 states and 9499 transitions. Word has length 134 [2019-12-07 10:28:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:28:11,670 INFO L462 AbstractCegarLoop]: Abstraction has 6806 states and 9499 transitions. [2019-12-07 10:28:11,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:28:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6806 states and 9499 transitions. [2019-12-07 10:28:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 10:28:11,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:28:11,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:28:11,673 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:28:11,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:28:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash 568885651, now seen corresponding path program 1 times [2019-12-07 10:28:11,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:28:11,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662952724] [2019-12-07 10:28:11,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:28:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:28:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:28:11,877 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 10:28:11,877 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:28:12,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:28:12 BoogieIcfgContainer [2019-12-07 10:28:12,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:28:12,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:28:12,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:28:12,035 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:28:12,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:27:29" (3/4) ... [2019-12-07 10:28:12,037 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:28:12,156 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bd306d3a-6ce4-4c6b-a66a-aacc596ca426/bin/utaipan/witness.graphml [2019-12-07 10:28:12,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:28:12,156 INFO L168 Benchmark]: Toolchain (without parser) took 44856.73 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 942.4 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 318.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:12,157 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:28:12,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:12,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:12,157 INFO L168 Benchmark]: Boogie Preprocessor took 36.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:12,157 INFO L168 Benchmark]: RCFGBuilder took 1383.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.5 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:12,158 INFO L168 Benchmark]: TraceAbstraction took 42805.15 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 256.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:12,158 INFO L168 Benchmark]: Witness Printer took 120.74 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:28:12,159 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 459.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1383.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.5 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42805.15 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 256.2 MB. Max. memory is 11.5 GB. * Witness Printer took 120.74 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] port_t p12 = 0; [L14] char p12_old = '\x0'; [L15] char p12_new = '\x0'; [L16] _Bool ep12 = 0; [L17] port_t p13 = 0; [L18] char p13_old = '\x0'; [L19] char p13_new = '\x0'; [L20] _Bool ep13 = 0; [L21] port_t p21 = 0; [L22] char p21_old = '\x0'; [L23] char p21_new = '\x0'; [L24] _Bool ep21 = 0; [L25] port_t p23 = 0; [L26] char p23_old = '\x0'; [L27] char p23_new = '\x0'; [L28] _Bool ep23 = 0; [L29] port_t p31 = 0; [L30] char p31_old = '\x0'; [L31] char p31_new = '\x0'; [L32] _Bool ep31 = 0; [L33] port_t p32 = 0; [L34] char p32_old = '\x0'; [L35] char p32_new = '\x0'; [L36] _Bool ep32 = 0; [L37] char id1 = '\x0'; [L38] unsigned char r1 = '\x0'; [L39] char st1 = '\x0'; [L40] char nl1 = '\x0'; [L41] char m1 = '\x0'; [L42] char max1 = '\x0'; [L43] _Bool mode1 = 0; [L44] _Bool newmax1 = 0; [L45] char id2 = '\x0'; [L46] unsigned char r2 = '\x0'; [L47] char st2 = '\x0'; [L48] char nl2 = '\x0'; [L49] char m2 = '\x0'; [L50] char max2 = '\x0'; [L51] _Bool mode2 = 0; [L52] _Bool newmax2 = 0; [L53] char id3 = '\x0'; [L54] unsigned char r3 = '\x0'; [L55] char st3 = '\x0'; [L56] char nl3 = '\x0'; [L57] char m3 = '\x0'; [L58] char max3 = '\x0'; [L59] _Bool mode3 = 0; [L60] _Bool newmax3 = 0; [L64] void (*nodes[3])() = { &node1, &node2, &node3 }; [L68] int __return_1897; [L69] int __return_2043; [L70] int __return_2176; [L71] int __return_2312; [L72] int __return_2456; [L73] int __return_2581; [L76] int main__c1; [L77] int main__i2; [L78] main__c1 = 0 [L79] ep12 = __VERIFIER_nondet_bool() [L80] ep13 = __VERIFIER_nondet_bool() [L81] ep21 = __VERIFIER_nondet_bool() [L82] ep23 = __VERIFIER_nondet_bool() [L83] ep31 = __VERIFIER_nondet_bool() [L84] ep32 = __VERIFIER_nondet_bool() [L85] id1 = __VERIFIER_nondet_char() [L86] r1 = __VERIFIER_nondet_uchar() [L87] st1 = __VERIFIER_nondet_char() [L88] nl1 = __VERIFIER_nondet_char() [L89] m1 = __VERIFIER_nondet_char() [L90] max1 = __VERIFIER_nondet_char() [L91] mode1 = __VERIFIER_nondet_bool() [L92] newmax1 = __VERIFIER_nondet_bool() [L93] id2 = __VERIFIER_nondet_char() [L94] r2 = __VERIFIER_nondet_uchar() [L95] st2 = __VERIFIER_nondet_char() [L96] nl2 = __VERIFIER_nondet_char() [L97] m2 = __VERIFIER_nondet_char() [L98] max2 = __VERIFIER_nondet_char() [L99] mode2 = __VERIFIER_nondet_bool() [L100] newmax2 = __VERIFIER_nondet_bool() [L101] id3 = __VERIFIER_nondet_char() [L102] r3 = __VERIFIER_nondet_uchar() [L103] st3 = __VERIFIER_nondet_char() [L104] nl3 = __VERIFIER_nondet_char() [L105] m3 = __VERIFIER_nondet_char() [L106] max3 = __VERIFIER_nondet_char() [L107] mode3 = __VERIFIER_nondet_bool() [L108] newmax3 = __VERIFIER_nondet_bool() [L110] _Bool init__r121; [L111] _Bool init__r131; [L112] _Bool init__r211; [L113] _Bool init__r231; [L114] _Bool init__r311; [L115] _Bool init__r321; [L116] _Bool init__r122; [L117] int init__tmp; [L118] _Bool init__r132; [L119] int init__tmp___0; [L120] _Bool init__r212; [L121] int init__tmp___1; [L122] _Bool init__r232; [L123] int init__tmp___2; [L124] _Bool init__r312; [L125] int init__tmp___3; [L126] _Bool init__r322; [L127] int init__tmp___4; [L128] int init__tmp___5; [L129] init__r121 = ep12 [L130] init__r131 = ep13 [L131] init__r211 = ep21 [L132] init__r231 = ep23 [L133] init__r311 = ep31 [L134] init__r321 = ep32 [L135] COND FALSE !(!(init__r121 == 0)) [L2493] COND TRUE !(init__r131 == 0) [L2495] COND TRUE !(ep32 == 0) [L2497] init__tmp = 1 [L139] init__r122 = (_Bool)init__tmp [L140] COND TRUE !(init__r131 == 0) [L142] init__tmp___0 = 1 [L144] init__r132 = (_Bool)init__tmp___0 [L145] COND TRUE !(init__r211 == 0) [L147] init__tmp___1 = 1 [L149] init__r212 = (_Bool)init__tmp___1 [L150] COND FALSE !(!(init__r231 == 0)) [L2424] COND TRUE !(init__r211 == 0) [L2426] COND TRUE !(ep13 == 0) [L2428] init__tmp___2 = 1 [L154] init__r232 = (_Bool)init__tmp___2 [L155] COND FALSE !(!(init__r311 == 0)) [L2401] COND TRUE !(init__r321 == 0) [L2403] COND TRUE !(ep21 == 0) [L2405] init__tmp___3 = 1 [L159] init__r312 = (_Bool)init__tmp___3 [L160] COND TRUE !(init__r321 == 0) [L162] init__tmp___4 = 1 [L164] init__r322 = (_Bool)init__tmp___4 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)id1) >= 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id2) >= 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)id3) >= 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)r1) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)r2) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)r3) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE !(init__r122 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r132 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE !(init__r212 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE !(init__r232 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r312 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE !(init__r322 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)st1) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)st2) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)st3) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)nl1) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)nl2) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)nl3) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)mode1) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)mode2) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)mode3) == 0 VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE !(newmax1 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE !(newmax2 == 0) VAL [__return_1897=0, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE !(newmax3 == 0) [L225] init__tmp___5 = 1 [L226] __return_1897 = init__tmp___5 [L227] main__i2 = __return_1897 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L228] COND TRUE main__i2 != 0 [L230] p12_old = nomsg [L231] p12_new = nomsg [L232] p13_old = nomsg [L233] p13_new = nomsg [L234] p21_old = nomsg [L235] p21_new = nomsg [L236] p23_old = nomsg [L237] p23_new = nomsg [L238] p31_old = nomsg [L239] p31_new = nomsg [L240] p32_old = nomsg [L241] p32_new = nomsg [L242] main__i2 = 0 [L244] _Bool node1__newmax; [L245] node1__newmax = 0 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L246] COND FALSE !(!(mode1 == 0)) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE ((int)r1) < 2 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND FALSE !(!(ep12 == 0)) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE !(ep13 == 0) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND TRUE !(newmax1 == 0) [L271] int node1____CPAchecker_TMP_1; VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] COND TRUE max1 != nomsg VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L274] COND TRUE p13_new == nomsg [L276] node1____CPAchecker_TMP_1 = max1 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L280] mode1 = 1 [L282] _Bool node2__newmax; [L283] node2__newmax = 0 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L284] COND FALSE !(!(mode2 == 0)) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L290] COND TRUE ((int)r2) < 2 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L292] COND TRUE !(ep21 == 0) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L294] COND TRUE !(newmax2 == 0) [L296] int node2____CPAchecker_TMP_0; VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L297] COND TRUE max2 != nomsg VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L299] COND TRUE p21_new == nomsg [L301] node2____CPAchecker_TMP_0 = max2 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, 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] [L303] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L305] COND FALSE !(!(ep23 == 0)) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L318] mode2 = 1 [L320] _Bool node3__newmax; [L321] node3__newmax = 0 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L322] COND FALSE !(!(mode3 == 0)) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L328] COND TRUE ((int)r3) < 2 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L330] COND FALSE !(!(ep31 == 0)) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L343] COND TRUE !(ep32 == 0) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L345] COND TRUE !(newmax3 == 0) [L347] int node3____CPAchecker_TMP_1; VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L348] COND TRUE max3 != nomsg VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L350] COND TRUE p32_new == nomsg [L352] node3____CPAchecker_TMP_1 = max3 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, 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] [L354] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=3, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=4, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] mode3 = 1 [L357] p12_old = p12_new [L358] p12_new = nomsg [L359] p13_old = p13_new [L360] p13_new = nomsg [L361] p21_old = p21_new [L362] p21_new = nomsg [L363] p23_old = p23_new [L364] p23_new = nomsg [L365] p31_old = p31_new [L366] p31_new = nomsg [L367] p32_old = p32_new [L368] p32_new = nomsg [L370] int check__tmp; VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L379] COND FALSE !(((int)r1) >= 2) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND TRUE ((int)r1) < 2 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND FALSE !(((int)r1) >= 2) VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1897=1, __return_2043=0, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L397] COND TRUE ((int)r1) < 2 [L399] check__tmp = 1 [L400] __return_2043 = check__tmp [L401] main__c1 = __return_2043 [L403] _Bool __tmp_1; [L404] __tmp_1 = main__c1 [L405] _Bool assert__arg; [L406] assert__arg = __tmp_1 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND FALSE !(assert__arg == 0) [L414] _Bool node1__newmax; [L415] node1__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE !(mode1 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=0, m2=1, m3=1, max1=3, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND FALSE !(r1 == 255) [L424] r1 = r1 + 1 [L425] COND TRUE !(ep21 == 0) [L427] m1 = p21_old [L428] p21_old = nomsg [L429] COND TRUE ((int)m1) > ((int)max1) [L431] max1 = m1 [L432] node1__newmax = 1 [L434] COND FALSE !(!(ep31 == 0)) [L443] newmax1 = node1__newmax VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=1, m3=1, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L444] COND FALSE !(((int)r1) == 2) [L450] mode1 = 0 [L452] _Bool node2__newmax; [L453] node2__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=1, m3=1, max1=5, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE !(mode2 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=1, m3=1, max1=5, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND FALSE !(r2 == 255) [L462] r2 = r2 + 1 [L463] COND FALSE !(!(ep12 == 0)) [L472] COND TRUE !(ep32 == 0) [L474] m2 = p32_old [L475] p32_old = nomsg [L476] COND FALSE !(((int)m2) > ((int)max2)) [L481] newmax2 = node2__newmax VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=1, max1=5, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=0, st1=0, st2=0, st3=0] [L482] COND FALSE !(((int)r2) == 2) [L488] mode2 = 0 [L490] _Bool node3__newmax; [L491] node3__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=1, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=0, st1=0, st2=0, st3=0] [L492] COND TRUE !(mode3 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=1, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, 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=0, st1=0, st2=0, st3=0] [L494] COND FALSE !(r3 == 255) [L500] r3 = r3 + 1 [L501] COND TRUE !(ep13 == 0) [L503] m3 = p13_old [L504] p13_old = nomsg [L505] COND FALSE !(((int)m3) > ((int)max3)) [L510] COND FALSE !(!(ep23 == 0)) [L519] newmax3 = node3__newmax VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L520] COND FALSE !(((int)r3) == 2) [L526] mode3 = 0 [L527] p12_old = p12_new [L528] p12_new = nomsg [L529] p13_old = p13_new [L530] p13_new = nomsg [L531] p21_old = p21_new [L532] p21_new = nomsg [L533] p23_old = p23_new [L534] p23_new = nomsg [L535] p31_old = p31_new [L536] p31_new = nomsg [L537] p32_old = p32_new [L538] p32_new = nomsg [L540] int check__tmp; VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L541] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L543] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L547] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L549] COND FALSE !(((int)r1) >= 2) VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L555] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L557] COND TRUE ((int)r1) < 2 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L559] COND FALSE !(((int)r1) >= 2) VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L565] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1897=1, __return_2043=1, __return_2176=0, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L567] COND TRUE ((int)r1) < 2 [L569] check__tmp = 1 [L570] __return_2176 = check__tmp [L571] main__c1 = __return_2176 [L573] _Bool __tmp_2; [L574] __tmp_2 = main__c1 [L575] _Bool assert__arg; [L576] assert__arg = __tmp_2 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L577] COND FALSE !(assert__arg == 0) [L584] _Bool node1__newmax; [L585] node1__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L586] COND FALSE !(!(mode1 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L592] COND TRUE ((int)r1) < 2 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L594] COND FALSE !(!(ep12 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L607] COND TRUE !(ep13 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L609] COND TRUE !(newmax1 == 0) [L611] int node1____CPAchecker_TMP_1; VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L612] COND TRUE max1 != nomsg VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L614] COND TRUE p13_new == nomsg [L616] node1____CPAchecker_TMP_1 = max1 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L618] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L620] mode1 = 1 [L622] _Bool node2__newmax; [L623] node2__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L624] COND FALSE !(!(mode2 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L630] COND TRUE ((int)r2) < 2 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L632] COND TRUE !(ep21 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L634] COND FALSE !(!(newmax2 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L645] COND FALSE !(!(ep23 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L658] mode2 = 1 [L660] _Bool node3__newmax; [L661] node3__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L662] COND FALSE !(!(mode3 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L668] COND TRUE ((int)r3) < 2 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L670] COND FALSE !(!(ep31 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L683] COND TRUE !(ep32 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L685] COND FALSE !(!(newmax3 == 0)) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, 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] [L696] mode3 = 1 [L697] p12_old = p12_new [L698] p12_new = nomsg [L699] p13_old = p13_new [L700] p13_new = nomsg [L701] p21_old = p21_new [L702] p21_new = nomsg [L703] p23_old = p23_new [L704] p23_new = nomsg [L705] p31_old = p31_new [L706] p31_new = nomsg [L707] p32_old = p32_new [L708] p32_new = nomsg [L710] int check__tmp; VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L711] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L713] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L715] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L717] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L719] COND FALSE !(((int)r1) >= 2) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L725] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L727] COND TRUE ((int)r1) < 2 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L729] COND FALSE !(((int)r1) >= 2) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L735] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=0, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L737] COND TRUE ((int)r1) < 2 [L739] check__tmp = 1 [L740] __return_2312 = check__tmp [L741] main__c1 = __return_2312 [L743] _Bool __tmp_3; [L744] __tmp_3 = main__c1 [L745] _Bool assert__arg; [L746] assert__arg = __tmp_3 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L747] COND FALSE !(assert__arg == 0) [L754] _Bool node1__newmax; [L755] node1__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L756] COND TRUE !(mode1 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=5, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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] [L758] COND FALSE !(r1 == 255) [L764] r1 = r1 + 1 [L765] COND TRUE !(ep21 == 0) [L767] m1 = p21_old [L768] p21_old = nomsg [L769] COND FALSE !(((int)m1) > ((int)max1)) [L774] COND FALSE !(!(ep31 == 0)) [L783] newmax1 = node1__newmax VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=1, r3=1, st1=0, st2=0, st3=0] [L784] COND TRUE ((int)r1) == 2 [L786] COND FALSE !(((int)max1) == ((int)id1)) [L1660] st1 = 1 [L790] mode1 = 0 [L792] _Bool node2__newmax; [L793] node2__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=1, r3=1, st1=1, st2=0, st3=0] [L794] COND TRUE !(mode2 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=4, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=1, r3=1, st1=1, st2=0, st3=0] [L796] COND FALSE !(r2 == 255) [L802] r2 = r2 + 1 [L803] COND FALSE !(!(ep12 == 0)) [L812] COND TRUE !(ep32 == 0) [L814] m2 = p32_old [L815] p32_old = nomsg [L816] COND FALSE !(((int)m2) > ((int)max2)) [L821] newmax2 = node2__newmax VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=1, st1=1, st2=0, st3=0] [L822] COND TRUE ((int)r2) == 2 [L824] COND TRUE ((int)max2) == ((int)id2) [L826] st2 = 1 [L828] mode2 = 0 [L830] _Bool node3__newmax; [L831] node3__newmax = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=1, st1=1, st2=1, st3=0] [L832] COND TRUE !(mode3 == 0) VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=3, max1=5, max2=5, max3=4, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, 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=1, st1=1, st2=1, st3=0] [L834] COND FALSE !(r3 == 255) [L840] r3 = r3 + 1 [L841] COND TRUE !(ep13 == 0) [L843] m3 = p13_old [L844] p13_old = nomsg [L845] COND TRUE ((int)m3) > ((int)max3) [L847] max3 = m3 [L848] node3__newmax = 1 [L850] COND FALSE !(!(ep23 == 0)) [L859] newmax3 = node3__newmax VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L860] COND TRUE ((int)r3) == 2 [L862] COND FALSE !(((int)max3) == ((int)id3)) [L1584] nl3 = 1 [L866] mode3 = 0 [L867] p12_old = p12_new [L868] p12_new = nomsg [L869] p13_old = p13_new [L870] p13_new = nomsg [L871] p21_old = p21_new [L872] p21_new = nomsg [L873] p23_old = p23_new [L874] p23_new = nomsg [L875] p31_old = p31_new [L876] p31_new = nomsg [L877] p32_old = p32_new [L878] p32_new = nomsg [L880] int check__tmp; VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L881] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1577] check__tmp = 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L909] __return_2456 = check__tmp [L910] main__c1 = __return_2456 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L913] _Bool __tmp_4; [L914] __tmp_4 = main__c1 [L915] _Bool assert__arg; [L916] assert__arg = __tmp_4 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L917] COND TRUE assert__arg == 0 VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L919] __VERIFIER_error() VAL [__return_1897=1, __return_2043=1, __return_2176=1, __return_2312=1, __return_2456=0, __return_2581=0, __return_main=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=3, id2=5, id3=4, m1=-1, m2=-1, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 250 locations, 1 error locations. Result: UNSAFE, OverallTime: 42.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7701 SDtfs, 16163 SDslu, 17861 SDs, 0 SdLazy, 6718 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 33 SyntacticMatches, 15 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8050occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 6436 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2979 NumberOfCodeBlocks, 2979 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2821 ConstructedInterpolants, 0 QuantifiedInterpolants, 3219904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...