./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc1e09d0a185b5e28aca558590d685af7160ef3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:14:14,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:14:14,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:14:14,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:14:14,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:14:14,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:14:14,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:14:14,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:14:14,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:14:14,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:14:14,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:14:14,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:14:14,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:14:14,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:14:14,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:14:14,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:14:14,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:14:14,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:14:14,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:14:14,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:14:14,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:14:14,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:14:14,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:14:14,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:14:14,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:14:14,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:14:14,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:14:14,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:14:14,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:14:14,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:14:14,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:14:14,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:14:14,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:14:14,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:14:14,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:14:14,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:14:14,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:14:14,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:14:14,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:14:14,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:14:14,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:14:14,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:14:14,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:14:14,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:14:14,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:14:14,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:14:14,669 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:14:14,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:14:14,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:14:14,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:14:14,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:14:14,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:14:14,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:14:14,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:14:14,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:14:14,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:14:14,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:14:14,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:14:14,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:14:14,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:14:14,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:14:14,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:14:14,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:14:14,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:14:14,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:14:14,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:14:14,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:14:14,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:14:14,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:14:14,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:14:14,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer 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 -> Automizer 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 -> 4fc1e09d0a185b5e28aca558590d685af7160ef3 [2019-11-20 01:14:14,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:14:14,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:14:14,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:14:14,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:14:14,871 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:14:14,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 01:14:14,930 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/data/6d913fea8/b9ccfa7423e14562bb27232942895ce0/FLAG36b7e87d6 [2019-11-20 01:14:15,381 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:14:15,381 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 01:14:15,391 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/data/6d913fea8/b9ccfa7423e14562bb27232942895ce0/FLAG36b7e87d6 [2019-11-20 01:14:15,403 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/data/6d913fea8/b9ccfa7423e14562bb27232942895ce0 [2019-11-20 01:14:15,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:14:15,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:14:15,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:14:15,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:14:15,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:14:15,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:14:15" (1/1) ... [2019-11-20 01:14:15,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8f14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:15, skipping insertion in model container [2019-11-20 01:14:15,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:14:15" (1/1) ... [2019-11-20 01:14:15,422 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:14:15,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:14:16,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:14:16,011 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:14:16,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:14:16,153 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:14:16,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16 WrapperNode [2019-11-20 01:14:16,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:14:16,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:14:16,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:14:16,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:14:16,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:14:16,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:14:16,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:14:16,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:14:16,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... [2019-11-20 01:14:16,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:14:16,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:14:16,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:14:16,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:14:16,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/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-11-20 01:14:16,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:14:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:14:17,524 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:14:17,524 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 01:14:17,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:14:17 BoogieIcfgContainer [2019-11-20 01:14:17,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:14:17,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:14:17,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:14:17,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:14:17,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:14:15" (1/3) ... [2019-11-20 01:14:17,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0e0358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:14:17, skipping insertion in model container [2019-11-20 01:14:17,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:14:16" (2/3) ... [2019-11-20 01:14:17,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0e0358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:14:17, skipping insertion in model container [2019-11-20 01:14:17,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:14:17" (3/3) ... [2019-11-20 01:14:17,537 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-20 01:14:17,545 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:14:17,553 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:14:17,562 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:14:17,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:14:17,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:14:17,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:14:17,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:14:17,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:14:17,602 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:14:17,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:14:17,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:14:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2019-11-20 01:14:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 01:14:17,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:17,634 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] [2019-11-20 01:14:17,634 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1005429677, now seen corresponding path program 1 times [2019-11-20 01:14:17,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:17,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380894312] [2019-11-20 01:14:17,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:18,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380894312] [2019-11-20 01:14:18,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:18,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:18,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900702940] [2019-11-20 01:14:18,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:18,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:18,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:18,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:18,252 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 4 states. [2019-11-20 01:14:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:18,449 INFO L93 Difference]: Finished difference Result 714 states and 1248 transitions. [2019-11-20 01:14:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:18,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 01:14:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:18,477 INFO L225 Difference]: With dead ends: 714 [2019-11-20 01:14:18,479 INFO L226 Difference]: Without dead ends: 470 [2019-11-20 01:14:18,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-20 01:14:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2019-11-20 01:14:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-20 01:14:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 689 transitions. [2019-11-20 01:14:18,581 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 689 transitions. Word has length 101 [2019-11-20 01:14:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:18,582 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 689 transitions. [2019-11-20 01:14:18,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 689 transitions. [2019-11-20 01:14:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 01:14:18,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:18,588 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] [2019-11-20 01:14:18,589 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash -769716679, now seen corresponding path program 1 times [2019-11-20 01:14:18,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:18,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035032913] [2019-11-20 01:14:18,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:18,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035032913] [2019-11-20 01:14:18,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:18,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:18,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440443539] [2019-11-20 01:14:18,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:18,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:18,713 INFO L87 Difference]: Start difference. First operand 468 states and 689 transitions. Second operand 3 states. [2019-11-20 01:14:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:18,788 INFO L93 Difference]: Finished difference Result 1366 states and 2005 transitions. [2019-11-20 01:14:18,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:18,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 01:14:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:18,795 INFO L225 Difference]: With dead ends: 1366 [2019-11-20 01:14:18,795 INFO L226 Difference]: Without dead ends: 926 [2019-11-20 01:14:18,802 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-11-20 01:14:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-20 01:14:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2019-11-20 01:14:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-20 01:14:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 691 transitions. [2019-11-20 01:14:18,863 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 691 transitions. Word has length 102 [2019-11-20 01:14:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:18,863 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 691 transitions. [2019-11-20 01:14:18,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 691 transitions. [2019-11-20 01:14:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:14:18,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:18,874 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] [2019-11-20 01:14:18,874 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1142488916, now seen corresponding path program 1 times [2019-11-20 01:14:18,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:18,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728739105] [2019-11-20 01:14:18,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:18,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728739105] [2019-11-20 01:14:18,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:18,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:18,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010487785] [2019-11-20 01:14:18,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:18,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:18,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:18,995 INFO L87 Difference]: Start difference. First operand 470 states and 691 transitions. Second operand 3 states. [2019-11-20 01:14:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:19,062 INFO L93 Difference]: Finished difference Result 977 states and 1492 transitions. [2019-11-20 01:14:19,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:19,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-20 01:14:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:19,067 INFO L225 Difference]: With dead ends: 977 [2019-11-20 01:14:19,067 INFO L226 Difference]: Without dead ends: 634 [2019-11-20 01:14:19,068 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-11-20 01:14:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-20 01:14:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2019-11-20 01:14:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-20 01:14:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 935 transitions. [2019-11-20 01:14:19,104 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 935 transitions. Word has length 103 [2019-11-20 01:14:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:19,104 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 935 transitions. [2019-11-20 01:14:19,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 935 transitions. [2019-11-20 01:14:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:14:19,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:19,106 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] [2019-11-20 01:14:19,107 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash -362955380, now seen corresponding path program 1 times [2019-11-20 01:14:19,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:19,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512991010] [2019-11-20 01:14:19,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:19,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512991010] [2019-11-20 01:14:19,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:19,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:19,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967645285] [2019-11-20 01:14:19,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:19,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:19,280 INFO L87 Difference]: Start difference. First operand 618 states and 935 transitions. Second operand 4 states. [2019-11-20 01:14:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:19,343 INFO L93 Difference]: Finished difference Result 1222 states and 1849 transitions. [2019-11-20 01:14:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:19,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 01:14:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:19,348 INFO L225 Difference]: With dead ends: 1222 [2019-11-20 01:14:19,348 INFO L226 Difference]: Without dead ends: 618 [2019-11-20 01:14:19,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-20 01:14:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 617. [2019-11-20 01:14:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-11-20 01:14:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 932 transitions. [2019-11-20 01:14:19,382 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 932 transitions. Word has length 103 [2019-11-20 01:14:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:19,382 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 932 transitions. [2019-11-20 01:14:19,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 932 transitions. [2019-11-20 01:14:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:14:19,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:19,384 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] [2019-11-20 01:14:19,385 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:19,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1648361287, now seen corresponding path program 1 times [2019-11-20 01:14:19,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:19,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181537287] [2019-11-20 01:14:19,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:19,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181537287] [2019-11-20 01:14:19,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:19,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:19,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116425960] [2019-11-20 01:14:19,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:19,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:19,525 INFO L87 Difference]: Start difference. First operand 617 states and 932 transitions. Second operand 4 states. [2019-11-20 01:14:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:19,590 INFO L93 Difference]: Finished difference Result 1225 states and 1851 transitions. [2019-11-20 01:14:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:19,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 01:14:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:19,596 INFO L225 Difference]: With dead ends: 1225 [2019-11-20 01:14:19,596 INFO L226 Difference]: Without dead ends: 615 [2019-11-20 01:14:19,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-20 01:14:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-11-20 01:14:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-11-20 01:14:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 928 transitions. [2019-11-20 01:14:19,630 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 928 transitions. Word has length 103 [2019-11-20 01:14:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:19,630 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 928 transitions. [2019-11-20 01:14:19,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 928 transitions. [2019-11-20 01:14:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:14:19,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:19,633 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] [2019-11-20 01:14:19,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:19,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash 101799940, now seen corresponding path program 1 times [2019-11-20 01:14:19,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:19,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055813864] [2019-11-20 01:14:19,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:19,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055813864] [2019-11-20 01:14:19,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:19,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:19,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023701093] [2019-11-20 01:14:19,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:19,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:19,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:19,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:19,733 INFO L87 Difference]: Start difference. First operand 615 states and 928 transitions. Second operand 3 states. [2019-11-20 01:14:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:19,815 INFO L93 Difference]: Finished difference Result 1334 states and 2036 transitions. [2019-11-20 01:14:19,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:19,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-20 01:14:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:19,823 INFO L225 Difference]: With dead ends: 1334 [2019-11-20 01:14:19,823 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 01:14:19,824 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-11-20 01:14:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 01:14:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2019-11-20 01:14:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-20 01:14:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1352 transitions. [2019-11-20 01:14:19,874 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1352 transitions. Word has length 103 [2019-11-20 01:14:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:19,875 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1352 transitions. [2019-11-20 01:14:19,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1352 transitions. [2019-11-20 01:14:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 01:14:19,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:19,877 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] [2019-11-20 01:14:19,877 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:19,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2115732183, now seen corresponding path program 1 times [2019-11-20 01:14:19,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:19,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984150360] [2019-11-20 01:14:19,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:19,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984150360] [2019-11-20 01:14:19,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:19,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:19,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630624640] [2019-11-20 01:14:19,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:19,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:19,945 INFO L87 Difference]: Start difference. First operand 907 states and 1352 transitions. Second operand 3 states. [2019-11-20 01:14:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:20,029 INFO L93 Difference]: Finished difference Result 1976 states and 3062 transitions. [2019-11-20 01:14:20,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:20,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 01:14:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:20,038 INFO L225 Difference]: With dead ends: 1976 [2019-11-20 01:14:20,038 INFO L226 Difference]: Without dead ends: 1335 [2019-11-20 01:14:20,039 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-11-20 01:14:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-11-20 01:14:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1291. [2019-11-20 01:14:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-11-20 01:14:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1975 transitions. [2019-11-20 01:14:20,131 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1975 transitions. Word has length 105 [2019-11-20 01:14:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:20,132 INFO L462 AbstractCegarLoop]: Abstraction has 1291 states and 1975 transitions. [2019-11-20 01:14:20,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1975 transitions. [2019-11-20 01:14:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 01:14:20,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:20,134 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] [2019-11-20 01:14:20,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -602590006, now seen corresponding path program 1 times [2019-11-20 01:14:20,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:20,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834684631] [2019-11-20 01:14:20,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:20,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834684631] [2019-11-20 01:14:20,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:20,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:20,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43085808] [2019-11-20 01:14:20,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:14:20,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:20,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:14:20,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:20,228 INFO L87 Difference]: Start difference. First operand 1291 states and 1975 transitions. Second operand 5 states. [2019-11-20 01:14:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:20,572 INFO L93 Difference]: Finished difference Result 3370 states and 5282 transitions. [2019-11-20 01:14:20,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:14:20,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-20 01:14:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:20,585 INFO L225 Difference]: With dead ends: 3370 [2019-11-20 01:14:20,585 INFO L226 Difference]: Without dead ends: 2255 [2019-11-20 01:14:20,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:14:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-11-20 01:14:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2253. [2019-11-20 01:14:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-11-20 01:14:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3503 transitions. [2019-11-20 01:14:20,721 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3503 transitions. Word has length 106 [2019-11-20 01:14:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:20,722 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 3503 transitions. [2019-11-20 01:14:20,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:14:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3503 transitions. [2019-11-20 01:14:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 01:14:20,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:20,725 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] [2019-11-20 01:14:20,725 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:20,725 INFO L82 PathProgramCache]: Analyzing trace with hash -404241499, now seen corresponding path program 1 times [2019-11-20 01:14:20,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:20,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417718379] [2019-11-20 01:14:20,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:20,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417718379] [2019-11-20 01:14:20,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:20,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:20,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242354974] [2019-11-20 01:14:20,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:20,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:20,886 INFO L87 Difference]: Start difference. First operand 2253 states and 3503 transitions. Second operand 4 states. [2019-11-20 01:14:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:21,218 INFO L93 Difference]: Finished difference Result 5816 states and 9062 transitions. [2019-11-20 01:14:21,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:21,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-20 01:14:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:21,239 INFO L225 Difference]: With dead ends: 5816 [2019-11-20 01:14:21,239 INFO L226 Difference]: Without dead ends: 3590 [2019-11-20 01:14:21,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-11-20 01:14:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3588. [2019-11-20 01:14:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-11-20 01:14:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5552 transitions. [2019-11-20 01:14:21,486 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5552 transitions. Word has length 106 [2019-11-20 01:14:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:21,486 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5552 transitions. [2019-11-20 01:14:21,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5552 transitions. [2019-11-20 01:14:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 01:14:21,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:21,489 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] [2019-11-20 01:14:21,489 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1846587040, now seen corresponding path program 1 times [2019-11-20 01:14:21,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:21,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775338630] [2019-11-20 01:14:21,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:21,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775338630] [2019-11-20 01:14:21,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:21,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:21,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490444540] [2019-11-20 01:14:21,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:21,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:21,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:21,565 INFO L87 Difference]: Start difference. First operand 3588 states and 5552 transitions. Second operand 3 states. [2019-11-20 01:14:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:21,934 INFO L93 Difference]: Finished difference Result 8744 states and 13633 transitions. [2019-11-20 01:14:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:21,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-20 01:14:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:21,964 INFO L225 Difference]: With dead ends: 8744 [2019-11-20 01:14:21,964 INFO L226 Difference]: Without dead ends: 5528 [2019-11-20 01:14:21,969 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-11-20 01:14:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-11-20 01:14:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5526. [2019-11-20 01:14:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5526 states. [2019-11-20 01:14:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5526 states to 5526 states and 8479 transitions. [2019-11-20 01:14:22,363 INFO L78 Accepts]: Start accepts. Automaton has 5526 states and 8479 transitions. Word has length 108 [2019-11-20 01:14:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:22,363 INFO L462 AbstractCegarLoop]: Abstraction has 5526 states and 8479 transitions. [2019-11-20 01:14:22,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 8479 transitions. [2019-11-20 01:14:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 01:14:22,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:22,367 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] [2019-11-20 01:14:22,367 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash 224725848, now seen corresponding path program 1 times [2019-11-20 01:14:22,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:22,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456070051] [2019-11-20 01:14:22,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:22,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456070051] [2019-11-20 01:14:22,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:22,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:22,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299870457] [2019-11-20 01:14:22,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:22,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:22,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:22,423 INFO L87 Difference]: Start difference. First operand 5526 states and 8479 transitions. Second operand 3 states. [2019-11-20 01:14:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:22,985 INFO L93 Difference]: Finished difference Result 14566 states and 22766 transitions. [2019-11-20 01:14:22,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:22,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-20 01:14:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:23,089 INFO L225 Difference]: With dead ends: 14566 [2019-11-20 01:14:23,089 INFO L226 Difference]: Without dead ends: 9372 [2019-11-20 01:14:23,095 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-11-20 01:14:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9372 states. [2019-11-20 01:14:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9372 to 8962. [2019-11-20 01:14:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8962 states. [2019-11-20 01:14:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8962 states to 8962 states and 13974 transitions. [2019-11-20 01:14:23,613 INFO L78 Accepts]: Start accepts. Automaton has 8962 states and 13974 transitions. Word has length 110 [2019-11-20 01:14:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:23,613 INFO L462 AbstractCegarLoop]: Abstraction has 8962 states and 13974 transitions. [2019-11-20 01:14:23,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 8962 states and 13974 transitions. [2019-11-20 01:14:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 01:14:23,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:23,617 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] [2019-11-20 01:14:23,617 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1189364322, now seen corresponding path program 1 times [2019-11-20 01:14:23,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:23,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526717276] [2019-11-20 01:14:23,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:23,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526717276] [2019-11-20 01:14:23,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:23,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:23,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394075826] [2019-11-20 01:14:23,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:23,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:23,767 INFO L87 Difference]: Start difference. First operand 8962 states and 13974 transitions. Second operand 4 states. [2019-11-20 01:14:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:24,759 INFO L93 Difference]: Finished difference Result 25027 states and 38954 transitions. [2019-11-20 01:14:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:24,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-20 01:14:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:24,795 INFO L225 Difference]: With dead ends: 25027 [2019-11-20 01:14:24,795 INFO L226 Difference]: Without dead ends: 16104 [2019-11-20 01:14:24,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-11-20 01:14:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16102. [2019-11-20 01:14:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-11-20 01:14:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 24827 transitions. [2019-11-20 01:14:25,937 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 24827 transitions. Word has length 111 [2019-11-20 01:14:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:25,938 INFO L462 AbstractCegarLoop]: Abstraction has 16102 states and 24827 transitions. [2019-11-20 01:14:25,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 24827 transitions. [2019-11-20 01:14:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 01:14:25,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:25,943 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] [2019-11-20 01:14:25,943 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2128482264, now seen corresponding path program 1 times [2019-11-20 01:14:25,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:25,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917151342] [2019-11-20 01:14:25,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:25,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917151342] [2019-11-20 01:14:25,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:25,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:25,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268182782] [2019-11-20 01:14:25,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:25,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:25,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:25,983 INFO L87 Difference]: Start difference. First operand 16102 states and 24827 transitions. Second operand 3 states. [2019-11-20 01:14:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:27,614 INFO L93 Difference]: Finished difference Result 48114 states and 74234 transitions. [2019-11-20 01:14:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:27,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-20 01:14:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:27,816 INFO L225 Difference]: With dead ends: 48114 [2019-11-20 01:14:27,817 INFO L226 Difference]: Without dead ends: 32117 [2019-11-20 01:14:27,837 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-11-20 01:14:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32117 states. [2019-11-20 01:14:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32117 to 16108. [2019-11-20 01:14:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16108 states. [2019-11-20 01:14:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16108 states to 16108 states and 24833 transitions. [2019-11-20 01:14:28,892 INFO L78 Accepts]: Start accepts. Automaton has 16108 states and 24833 transitions. Word has length 112 [2019-11-20 01:14:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:28,892 INFO L462 AbstractCegarLoop]: Abstraction has 16108 states and 24833 transitions. [2019-11-20 01:14:28,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16108 states and 24833 transitions. [2019-11-20 01:14:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 01:14:28,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:28,897 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] [2019-11-20 01:14:28,898 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1621970129, now seen corresponding path program 1 times [2019-11-20 01:14:28,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:28,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889932545] [2019-11-20 01:14:28,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:28,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889932545] [2019-11-20 01:14:28,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:28,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:28,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856473471] [2019-11-20 01:14:28,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:28,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:28,972 INFO L87 Difference]: Start difference. First operand 16108 states and 24833 transitions. Second operand 3 states. [2019-11-20 01:14:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:30,096 INFO L93 Difference]: Finished difference Result 41746 states and 64349 transitions. [2019-11-20 01:14:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:30,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-20 01:14:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:30,144 INFO L225 Difference]: With dead ends: 41746 [2019-11-20 01:14:30,144 INFO L226 Difference]: Without dead ends: 26384 [2019-11-20 01:14:30,168 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-11-20 01:14:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2019-11-20 01:14:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26382. [2019-11-20 01:14:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26382 states. [2019-11-20 01:14:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26382 states to 26382 states and 40027 transitions. [2019-11-20 01:14:31,535 INFO L78 Accepts]: Start accepts. Automaton has 26382 states and 40027 transitions. Word has length 113 [2019-11-20 01:14:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:31,535 INFO L462 AbstractCegarLoop]: Abstraction has 26382 states and 40027 transitions. [2019-11-20 01:14:31,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26382 states and 40027 transitions. [2019-11-20 01:14:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 01:14:31,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:31,543 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] [2019-11-20 01:14:31,543 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:31,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:31,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1799632340, now seen corresponding path program 1 times [2019-11-20 01:14:31,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:31,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142492937] [2019-11-20 01:14:31,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:31,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142492937] [2019-11-20 01:14:31,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:31,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:31,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280089636] [2019-11-20 01:14:31,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:31,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:31,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:31,655 INFO L87 Difference]: Start difference. First operand 26382 states and 40027 transitions. Second operand 4 states. [2019-11-20 01:14:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:32,644 INFO L93 Difference]: Finished difference Result 48995 states and 74626 transitions. [2019-11-20 01:14:32,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:32,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-20 01:14:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:32,680 INFO L225 Difference]: With dead ends: 48995 [2019-11-20 01:14:32,681 INFO L226 Difference]: Without dead ends: 23283 [2019-11-20 01:14:32,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2019-11-20 01:14:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 23283. [2019-11-20 01:14:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23283 states. [2019-11-20 01:14:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23283 states to 23283 states and 35373 transitions. [2019-11-20 01:14:34,003 INFO L78 Accepts]: Start accepts. Automaton has 23283 states and 35373 transitions. Word has length 113 [2019-11-20 01:14:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:34,004 INFO L462 AbstractCegarLoop]: Abstraction has 23283 states and 35373 transitions. [2019-11-20 01:14:34,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 23283 states and 35373 transitions. [2019-11-20 01:14:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 01:14:34,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:34,009 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] [2019-11-20 01:14:34,009 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash -812664826, now seen corresponding path program 1 times [2019-11-20 01:14:34,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:34,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102690513] [2019-11-20 01:14:34,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:34,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102690513] [2019-11-20 01:14:34,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:34,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:34,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290564563] [2019-11-20 01:14:34,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:34,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:34,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:34,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:34,128 INFO L87 Difference]: Start difference. First operand 23283 states and 35373 transitions. Second operand 4 states. [2019-11-20 01:14:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:35,142 INFO L93 Difference]: Finished difference Result 44591 states and 67806 transitions. [2019-11-20 01:14:35,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:35,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-20 01:14:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:35,168 INFO L225 Difference]: With dead ends: 44591 [2019-11-20 01:14:35,168 INFO L226 Difference]: Without dead ends: 21601 [2019-11-20 01:14:35,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21601 states. [2019-11-20 01:14:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21601 to 21559. [2019-11-20 01:14:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21559 states. [2019-11-20 01:14:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21559 states to 21559 states and 32717 transitions. [2019-11-20 01:14:36,264 INFO L78 Accepts]: Start accepts. Automaton has 21559 states and 32717 transitions. Word has length 116 [2019-11-20 01:14:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:36,264 INFO L462 AbstractCegarLoop]: Abstraction has 21559 states and 32717 transitions. [2019-11-20 01:14:36,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 21559 states and 32717 transitions. [2019-11-20 01:14:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 01:14:36,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:36,269 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-11-20 01:14:36,269 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash -929354459, now seen corresponding path program 1 times [2019-11-20 01:14:36,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:36,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171682040] [2019-11-20 01:14:36,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:36,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171682040] [2019-11-20 01:14:36,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:36,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:36,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311501483] [2019-11-20 01:14:36,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:36,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:36,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:36,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:36,397 INFO L87 Difference]: Start difference. First operand 21559 states and 32717 transitions. Second operand 4 states. [2019-11-20 01:14:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:37,542 INFO L93 Difference]: Finished difference Result 43127 states and 65445 transitions. [2019-11-20 01:14:37,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:37,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-20 01:14:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:37,566 INFO L225 Difference]: With dead ends: 43127 [2019-11-20 01:14:37,567 INFO L226 Difference]: Without dead ends: 21723 [2019-11-20 01:14:37,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21723 states. [2019-11-20 01:14:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21723 to 21661. [2019-11-20 01:14:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21661 states. [2019-11-20 01:14:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21661 states to 21661 states and 32820 transitions. [2019-11-20 01:14:38,818 INFO L78 Accepts]: Start accepts. Automaton has 21661 states and 32820 transitions. Word has length 118 [2019-11-20 01:14:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:38,818 INFO L462 AbstractCegarLoop]: Abstraction has 21661 states and 32820 transitions. [2019-11-20 01:14:38,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 21661 states and 32820 transitions. [2019-11-20 01:14:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 01:14:38,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:38,822 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] [2019-11-20 01:14:38,822 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:38,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1710773055, now seen corresponding path program 1 times [2019-11-20 01:14:38,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:38,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919255428] [2019-11-20 01:14:38,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:38,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919255428] [2019-11-20 01:14:38,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:38,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:38,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158027615] [2019-11-20 01:14:38,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:38,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:38,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:38,864 INFO L87 Difference]: Start difference. First operand 21661 states and 32820 transitions. Second operand 3 states. [2019-11-20 01:14:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:40,728 INFO L93 Difference]: Finished difference Result 58875 states and 89429 transitions. [2019-11-20 01:14:40,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:14:40,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-20 01:14:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:40,771 INFO L225 Difference]: With dead ends: 58875 [2019-11-20 01:14:40,771 INFO L226 Difference]: Without dead ends: 43115 [2019-11-20 01:14:40,782 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-11-20 01:14:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43115 states. [2019-11-20 01:14:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43115 to 21671. [2019-11-20 01:14:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21671 states. [2019-11-20 01:14:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21671 states to 21671 states and 32830 transitions. [2019-11-20 01:14:41,904 INFO L78 Accepts]: Start accepts. Automaton has 21671 states and 32830 transitions. Word has length 119 [2019-11-20 01:14:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:41,904 INFO L462 AbstractCegarLoop]: Abstraction has 21671 states and 32830 transitions. [2019-11-20 01:14:41,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:14:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21671 states and 32830 transitions. [2019-11-20 01:14:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 01:14:41,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:41,908 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-11-20 01:14:41,908 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash -993915098, now seen corresponding path program 1 times [2019-11-20 01:14:41,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:41,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262753074] [2019-11-20 01:14:41,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:42,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262753074] [2019-11-20 01:14:42,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:42,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:14:42,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401635917] [2019-11-20 01:14:42,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:14:42,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:14:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:14:42,015 INFO L87 Difference]: Start difference. First operand 21671 states and 32830 transitions. Second operand 4 states. [2019-11-20 01:14:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:43,488 INFO L93 Difference]: Finished difference Result 39799 states and 60385 transitions. [2019-11-20 01:14:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:43,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-20 01:14:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:43,508 INFO L225 Difference]: With dead ends: 39799 [2019-11-20 01:14:43,508 INFO L226 Difference]: Without dead ends: 21671 [2019-11-20 01:14:43,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2019-11-20 01:14:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21666. [2019-11-20 01:14:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21666 states. [2019-11-20 01:14:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 32817 transitions. [2019-11-20 01:14:44,506 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 32817 transitions. Word has length 120 [2019-11-20 01:14:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:44,506 INFO L462 AbstractCegarLoop]: Abstraction has 21666 states and 32817 transitions. [2019-11-20 01:14:44,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:14:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 32817 transitions. [2019-11-20 01:14:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 01:14:44,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:44,509 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-11-20 01:14:44,510 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1394285578, now seen corresponding path program 1 times [2019-11-20 01:14:44,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:44,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753850230] [2019-11-20 01:14:44,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:44,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753850230] [2019-11-20 01:14:44,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:44,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:14:44,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693050938] [2019-11-20 01:14:44,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:14:44,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:44,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:14:44,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:44,648 INFO L87 Difference]: Start difference. First operand 21666 states and 32817 transitions. Second operand 5 states. [2019-11-20 01:14:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:45,827 INFO L93 Difference]: Finished difference Result 35788 states and 54278 transitions. [2019-11-20 01:14:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:14:45,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-20 01:14:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:45,846 INFO L225 Difference]: With dead ends: 35788 [2019-11-20 01:14:45,847 INFO L226 Difference]: Without dead ends: 20187 [2019-11-20 01:14:45,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:14:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20187 states. [2019-11-20 01:14:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20187 to 20030. [2019-11-20 01:14:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20030 states. [2019-11-20 01:14:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20030 states to 20030 states and 30264 transitions. [2019-11-20 01:14:46,959 INFO L78 Accepts]: Start accepts. Automaton has 20030 states and 30264 transitions. Word has length 120 [2019-11-20 01:14:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:46,960 INFO L462 AbstractCegarLoop]: Abstraction has 20030 states and 30264 transitions. [2019-11-20 01:14:46,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:14:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20030 states and 30264 transitions. [2019-11-20 01:14:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 01:14:46,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:46,963 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] [2019-11-20 01:14:46,963 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1343086903, now seen corresponding path program 1 times [2019-11-20 01:14:46,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:46,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940350691] [2019-11-20 01:14:46,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:47,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940350691] [2019-11-20 01:14:47,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:47,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-20 01:14:47,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105892688] [2019-11-20 01:14:47,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:14:47,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:47,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:14:47,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:14:47,247 INFO L87 Difference]: Start difference. First operand 20030 states and 30264 transitions. Second operand 12 states. [2019-11-20 01:14:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:14:51,923 INFO L93 Difference]: Finished difference Result 73114 states and 112944 transitions. [2019-11-20 01:14:51,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:14:51,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-11-20 01:14:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:14:51,970 INFO L225 Difference]: With dead ends: 73114 [2019-11-20 01:14:51,970 INFO L226 Difference]: Without dead ends: 55192 [2019-11-20 01:14:51,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:14:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55192 states. [2019-11-20 01:14:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55192 to 46889. [2019-11-20 01:14:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46889 states. [2019-11-20 01:14:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46889 states to 46889 states and 71849 transitions. [2019-11-20 01:14:54,861 INFO L78 Accepts]: Start accepts. Automaton has 46889 states and 71849 transitions. Word has length 122 [2019-11-20 01:14:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:14:54,861 INFO L462 AbstractCegarLoop]: Abstraction has 46889 states and 71849 transitions. [2019-11-20 01:14:54,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:14:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46889 states and 71849 transitions. [2019-11-20 01:14:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 01:14:54,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:14:54,865 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] [2019-11-20 01:14:54,865 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:14:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:14:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1778231621, now seen corresponding path program 1 times [2019-11-20 01:14:54,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:14:54,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944640046] [2019-11-20 01:14:54,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:14:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:14:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:14:54,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944640046] [2019-11-20 01:14:54,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:14:54,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:14:54,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262325323] [2019-11-20 01:14:54,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:14:54,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:14:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:14:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:14:54,943 INFO L87 Difference]: Start difference. First operand 46889 states and 71849 transitions. Second operand 3 states. [2019-11-20 01:15:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:00,739 INFO L93 Difference]: Finished difference Result 133443 states and 207185 transitions. [2019-11-20 01:15:00,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:15:00,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-20 01:15:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:00,836 INFO L225 Difference]: With dead ends: 133443 [2019-11-20 01:15:00,836 INFO L226 Difference]: Without dead ends: 90157 [2019-11-20 01:15:00,867 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-11-20 01:15:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90157 states. [2019-11-20 01:15:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90157 to 90083. [2019-11-20 01:15:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90083 states. [2019-11-20 01:15:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90083 states to 90083 states and 137239 transitions. [2019-11-20 01:15:06,444 INFO L78 Accepts]: Start accepts. Automaton has 90083 states and 137239 transitions. Word has length 122 [2019-11-20 01:15:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:06,445 INFO L462 AbstractCegarLoop]: Abstraction has 90083 states and 137239 transitions. [2019-11-20 01:15:06,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:15:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 90083 states and 137239 transitions. [2019-11-20 01:15:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 01:15:06,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:06,449 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] [2019-11-20 01:15:06,449 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1090994532, now seen corresponding path program 1 times [2019-11-20 01:15:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:06,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552749397] [2019-11-20 01:15:06,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:06,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552749397] [2019-11-20 01:15:06,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:06,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:15:06,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707080784] [2019-11-20 01:15:06,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:15:06,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:15:06,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:06,610 INFO L87 Difference]: Start difference. First operand 90083 states and 137239 transitions. Second operand 8 states. [2019-11-20 01:15:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:14,293 INFO L93 Difference]: Finished difference Result 176995 states and 270863 transitions. [2019-11-20 01:15:14,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:15:14,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-11-20 01:15:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:14,384 INFO L225 Difference]: With dead ends: 176995 [2019-11-20 01:15:14,384 INFO L226 Difference]: Without dead ends: 90085 [2019-11-20 01:15:14,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:15:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90085 states. [2019-11-20 01:15:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90085 to 54886. [2019-11-20 01:15:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54886 states. [2019-11-20 01:15:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54886 states to 54886 states and 82979 transitions. [2019-11-20 01:15:18,404 INFO L78 Accepts]: Start accepts. Automaton has 54886 states and 82979 transitions. Word has length 122 [2019-11-20 01:15:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:18,404 INFO L462 AbstractCegarLoop]: Abstraction has 54886 states and 82979 transitions. [2019-11-20 01:15:18,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:15:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 54886 states and 82979 transitions. [2019-11-20 01:15:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 01:15:18,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:18,408 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] [2019-11-20 01:15:18,408 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1976470388, now seen corresponding path program 1 times [2019-11-20 01:15:18,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:18,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946391482] [2019-11-20 01:15:18,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:18,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946391482] [2019-11-20 01:15:18,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:18,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:15:18,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164777411] [2019-11-20 01:15:18,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:18,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:18,536 INFO L87 Difference]: Start difference. First operand 54886 states and 82979 transitions. Second operand 6 states. [2019-11-20 01:15:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:29,154 INFO L93 Difference]: Finished difference Result 211808 states and 322091 transitions. [2019-11-20 01:15:29,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:15:29,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-11-20 01:15:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:29,330 INFO L225 Difference]: With dead ends: 211808 [2019-11-20 01:15:29,330 INFO L226 Difference]: Without dead ends: 157938 [2019-11-20 01:15:29,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157938 states. [2019-11-20 01:15:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157938 to 157934. [2019-11-20 01:15:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157934 states. [2019-11-20 01:15:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157934 states to 157934 states and 239573 transitions. [2019-11-20 01:15:40,457 INFO L78 Accepts]: Start accepts. Automaton has 157934 states and 239573 transitions. Word has length 122 [2019-11-20 01:15:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:40,457 INFO L462 AbstractCegarLoop]: Abstraction has 157934 states and 239573 transitions. [2019-11-20 01:15:40,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 157934 states and 239573 transitions. [2019-11-20 01:15:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 01:15:40,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:40,461 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] [2019-11-20 01:15:40,461 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:15:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1986267249, now seen corresponding path program 1 times [2019-11-20 01:15:40,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:15:40,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781108473] [2019-11-20 01:15:40,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:15:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:41,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781108473] [2019-11-20 01:15:41,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:41,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-20 01:15:41,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643733552] [2019-11-20 01:15:41,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:15:41,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:15:41,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:15:41,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:15:41,411 INFO L87 Difference]: Start difference. First operand 157934 states and 239573 transitions. Second operand 23 states. [2019-11-20 01:16:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:14,479 INFO L93 Difference]: Finished difference Result 455292 states and 691889 transitions. [2019-11-20 01:16:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 01:16:14,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-11-20 01:16:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:15,054 INFO L225 Difference]: With dead ends: 455292 [2019-11-20 01:16:15,054 INFO L226 Difference]: Without dead ends: 357294 [2019-11-20 01:16:15,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 01:16:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357294 states. [2019-11-20 01:16:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357294 to 210188. [2019-11-20 01:16:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210188 states. [2019-11-20 01:16:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210188 states to 210188 states and 319396 transitions. [2019-11-20 01:16:34,733 INFO L78 Accepts]: Start accepts. Automaton has 210188 states and 319396 transitions. Word has length 122 [2019-11-20 01:16:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:34,734 INFO L462 AbstractCegarLoop]: Abstraction has 210188 states and 319396 transitions. [2019-11-20 01:16:34,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:16:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 210188 states and 319396 transitions. [2019-11-20 01:16:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 01:16:34,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:34,739 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] [2019-11-20 01:16:34,739 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:16:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:34,739 INFO L82 PathProgramCache]: Analyzing trace with hash -270948014, now seen corresponding path program 1 times [2019-11-20 01:16:34,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:16:34,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171838191] [2019-11-20 01:16:34,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:16:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:16:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:16:34,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:16:34,888 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:16:35,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:16:35 BoogieIcfgContainer [2019-11-20 01:16:35,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:16:35,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:16:35,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:16:35,090 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:16:35,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:14:17" (3/4) ... [2019-11-20 01:16:35,092 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 01:16:35,293 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7f9c32e-6737-465c-be87-802783c1a925/bin/uautomizer/witness.graphml [2019-11-20 01:16:35,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:16:35,296 INFO L168 Benchmark]: Toolchain (without parser) took 139888.64 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 944.8 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-20 01:16:35,296 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:16:35,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:35,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:35,297 INFO L168 Benchmark]: Boogie Preprocessor took 71.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:35,297 INFO L168 Benchmark]: RCFGBuilder took 1207.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:35,298 INFO L168 Benchmark]: TraceAbstraction took 137562.89 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-20 01:16:35,298 INFO L168 Benchmark]: Witness Printer took 203.97 ms. Allocated memory is still 6.2 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:35,300 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 747.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1207.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 137562.89 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 203.97 ms. Allocated memory is still 6.2 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 581]: 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_1248; [L69] int __return_1394; [L70] int __return_1528; [L71] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L74] int main__c1; [L75] int main__i2; [L76] main__c1 = 0 [L77] ep12 = __VERIFIER_nondet_bool() [L78] ep13 = __VERIFIER_nondet_bool() [L79] ep21 = __VERIFIER_nondet_bool() [L80] ep23 = __VERIFIER_nondet_bool() [L81] ep31 = __VERIFIER_nondet_bool() [L82] ep32 = __VERIFIER_nondet_bool() [L83] id1 = __VERIFIER_nondet_char() [L84] r1 = __VERIFIER_nondet_uchar() [L85] st1 = __VERIFIER_nondet_char() [L86] nl1 = __VERIFIER_nondet_char() [L87] m1 = __VERIFIER_nondet_char() [L88] max1 = __VERIFIER_nondet_char() [L89] mode1 = __VERIFIER_nondet_bool() [L90] newmax1 = __VERIFIER_nondet_bool() [L91] id2 = __VERIFIER_nondet_char() [L92] r2 = __VERIFIER_nondet_uchar() [L93] st2 = __VERIFIER_nondet_char() [L94] nl2 = __VERIFIER_nondet_char() [L95] m2 = __VERIFIER_nondet_char() [L96] max2 = __VERIFIER_nondet_char() [L97] mode2 = __VERIFIER_nondet_bool() [L98] newmax2 = __VERIFIER_nondet_bool() [L99] id3 = __VERIFIER_nondet_char() [L100] r3 = __VERIFIER_nondet_uchar() [L101] st3 = __VERIFIER_nondet_char() [L102] nl3 = __VERIFIER_nondet_char() [L103] m3 = __VERIFIER_nondet_char() [L104] max3 = __VERIFIER_nondet_char() [L105] mode3 = __VERIFIER_nondet_bool() [L106] newmax3 = __VERIFIER_nondet_bool() [L108] _Bool init__r121; [L109] _Bool init__r131; [L110] _Bool init__r211; [L111] _Bool init__r231; [L112] _Bool init__r311; [L113] _Bool init__r321; [L114] _Bool init__r122; [L115] int init__tmp; [L116] _Bool init__r132; [L117] int init__tmp___0; [L118] _Bool init__r212; [L119] int init__tmp___1; [L120] _Bool init__r232; [L121] int init__tmp___2; [L122] _Bool init__r312; [L123] int init__tmp___3; [L124] _Bool init__r322; [L125] int init__tmp___4; [L126] int init__tmp___5; [L127] init__r121 = ep12 [L128] init__r131 = ep13 [L129] init__r211 = ep21 [L130] init__r231 = ep23 [L131] init__r311 = ep31 [L132] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L133] COND TRUE !(init__r121 == 0) [L135] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L137] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L138] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L1759] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L1761] COND TRUE !(ep23 == 0) [L1763] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L142] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L143] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L1736] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L1738] COND TRUE !(ep31 == 0) [L1740] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L147] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L148] COND TRUE !(init__r231 == 0) [L150] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L152] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L153] COND TRUE !(init__r311 == 0) [L155] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L157] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L158] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L1667] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L1669] COND TRUE !(ep12 == 0) [L1671] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L162] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L163] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L165] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L167] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L169] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L171] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L173] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L175] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L177] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L179] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L181] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L183] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L185] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L187] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L189] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L191] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L193] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L195] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L197] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L199] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L201] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L203] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L205] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L207] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L209] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L211] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L213] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L215] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L217] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L219] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L221] COND TRUE !(newmax3 == 0) [L223] init__tmp___5 = 1 [L224] __return_1248 = init__tmp___5 [L225] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L226] COND TRUE main__i2 != 0 [L228] p12_old = nomsg [L229] p12_new = nomsg [L230] p13_old = nomsg [L231] p13_new = nomsg [L232] p21_old = nomsg [L233] p21_new = nomsg [L234] p23_old = nomsg [L235] p23_new = nomsg [L236] p31_old = nomsg [L237] p31_new = nomsg [L238] p32_old = nomsg [L239] p32_new = nomsg [L240] main__i2 = 0 [L242] _Bool node1__newmax; [L243] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L244] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L250] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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 !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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 TRUE !(newmax1 == 0) [L256] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L257] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L259] COND TRUE p12_new == nomsg [L261] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L263] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] [L265] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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] mode1 = 1 [L280] _Bool node2__newmax; [L281] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L282] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L288] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L290] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L303] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L305] COND TRUE !(newmax2 == 0) [L307] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L308] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L310] COND TRUE p23_new == nomsg [L312] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-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] [L314] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L316] mode2 = 1 [L318] _Bool node3__newmax; [L319] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L320] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L326] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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 !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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 TRUE !(newmax3 == 0) [L332] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L333] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L335] COND TRUE p31_new == nomsg [L337] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, 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] [L339] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=3, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L354] mode3 = 1 [L355] p12_old = p12_new [L356] p12_new = nomsg [L357] p13_old = p13_new [L358] p13_new = nomsg [L359] p21_old = p21_new [L360] p21_new = nomsg [L361] p23_old = p23_new [L362] p23_new = nomsg [L363] p31_old = p31_new [L364] p31_new = nomsg [L365] p32_old = p32_new [L366] p32_new = nomsg [L368] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE ((int)r1) < 2 [L397] check__tmp = 1 [L398] __return_1394 = check__tmp [L399] main__c1 = __return_1394 [L401] _Bool __tmp_1; [L402] __tmp_1 = main__c1 [L403] _Bool assert__arg; [L404] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(assert__arg == 0) [L412] _Bool node1__newmax; [L413] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(r1 == 255) [L422] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE !(ep31 == 0) [L434] m1 = p31_old [L435] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, 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=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L444] COND TRUE ((int)max1) == ((int)id1) [L446] st1 = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L448] mode1 = 0 [L450] _Bool node2__newmax; [L451] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L452] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L454] COND FALSE !(r2 == 255) [L460] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=0, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L461] COND TRUE !(ep12 == 0) [L463] m2 = p12_old [L464] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L465] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L470] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L480] COND FALSE !(((int)r2) == 2) [L486] mode2 = 0 [L488] _Bool node3__newmax; [L489] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L490] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L492] COND FALSE !(r3 == 255) [L498] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=0, max1=1, max2=3, max3=0, 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=3, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L508] COND TRUE !(ep23 == 0) [L510] m3 = p23_old [L511] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=0, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L512] COND TRUE ((int)m3) > ((int)max3) [L514] max3 = m3 [L515] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L517] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, 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=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L518] COND FALSE !(((int)r3) == 2) [L524] mode3 = 0 [L525] p12_old = p12_new [L526] p12_new = nomsg [L527] p13_old = p13_new [L528] p13_new = nomsg [L529] p21_old = p21_new [L530] p21_new = nomsg [L531] p23_old = p23_new [L532] p23_new = nomsg [L533] p31_old = p31_new [L534] p31_new = nomsg [L535] p32_old = p32_new [L536] p32_new = nomsg [L538] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L539] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L541] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L543] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L545] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L547] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1192] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L571] __return_1528 = check__tmp [L572] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L575] _Bool __tmp_2; [L576] __tmp_2 = main__c1 [L577] _Bool assert__arg; [L578] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L579] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L581] __VERIFIER_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=3, id3=0, m1=0, m2=1, m3=3, max1=1, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 247 locations, 1 error locations. Result: UNSAFE, OverallTime: 137.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 77.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12137 SDtfs, 16617 SDslu, 18571 SDs, 0 SdLazy, 4029 SolverSat, 316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210188occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 229346 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2924 NumberOfCodeBlocks, 2924 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2777 ConstructedInterpolants, 0 QuantifiedInterpolants, 1408477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...