./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 3cd23d8d7f8a24c697b198cd1c3251057e3687da ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-12 17:56:33,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 17:56:33,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 17:56:33,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 17:56:33,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 17:56:33,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 17:56:33,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 17:56:33,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 17:56:33,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 17:56:33,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 17:56:33,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 17:56:33,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 17:56:33,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 17:56:33,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 17:56:33,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 17:56:33,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 17:56:33,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 17:56:33,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 17:56:33,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 17:56:33,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 17:56:33,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 17:56:33,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 17:56:33,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 17:56:33,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 17:56:33,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 17:56:33,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 17:56:33,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 17:56:33,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 17:56:33,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 17:56:33,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 17:56:33,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 17:56:33,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 17:56:33,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 17:56:33,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 17:56:33,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 17:56:33,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 17:56:33,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 17:56:33,549 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 17:56:33,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 17:56:33,550 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 17:56:33,550 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 17:56:33,551 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 17:56:33,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 17:56:33,551 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 17:56:33,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 17:56:33,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 17:56:33,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 17:56:33,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 17:56:33,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 17:56:33,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 17:56:33,552 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 17:56:33,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 17:56:33,552 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 17:56:33,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 17:56:33,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 17:56:33,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 17:56:33,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 17:56:33,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 17:56:33,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 17:56:33,554 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 17:56:33,554 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 17:56:33,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 17:56:33,554 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 17:56:33,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 17:56:33,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 17:56:33,555 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 3cd23d8d7f8a24c697b198cd1c3251057e3687da [2019-01-12 17:56:33,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 17:56:33,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 17:56:33,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 17:56:33,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 17:56:33,602 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 17:56:33,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-01-12 17:56:33,654 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4b77f71/1dc61d5f6242454c8c608d8bafdfe281/FLAGcf7d14628 [2019-01-12 17:56:34,146 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 17:56:34,147 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded-reduced/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-01-12 17:56:34,161 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4b77f71/1dc61d5f6242454c8c608d8bafdfe281/FLAGcf7d14628 [2019-01-12 17:56:34,408 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4b77f71/1dc61d5f6242454c8c608d8bafdfe281 [2019-01-12 17:56:34,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 17:56:34,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 17:56:34,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 17:56:34,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 17:56:34,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 17:56:34,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:56:34" (1/1) ... [2019-01-12 17:56:34,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a2acbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:34, skipping insertion in model container [2019-01-12 17:56:34,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:56:34" (1/1) ... [2019-01-12 17:56:34,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 17:56:34,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 17:56:35,096 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:56:35,110 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 17:56:35,311 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 17:56:35,427 INFO L195 MainTranslator]: Completed translation [2019-01-12 17:56:35,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35 WrapperNode [2019-01-12 17:56:35,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 17:56:35,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 17:56:35,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 17:56:35,429 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 17:56:35,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 17:56:35,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 17:56:35,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 17:56:35,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 17:56:35,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... [2019-01-12 17:56:35,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 17:56:35,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 17:56:35,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 17:56:35,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 17:56:35,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-12 17:56:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 17:56:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 17:56:38,537 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 17:56:38,538 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 17:56:38,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:56:38 BoogieIcfgContainer [2019-01-12 17:56:38,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 17:56:38,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 17:56:38,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 17:56:38,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 17:56:38,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:56:34" (1/3) ... [2019-01-12 17:56:38,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ece9522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:56:38, skipping insertion in model container [2019-01-12 17:56:38,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:56:35" (2/3) ... [2019-01-12 17:56:38,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ece9522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:56:38, skipping insertion in model container [2019-01-12 17:56:38,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:56:38" (3/3) ... [2019-01-12 17:56:38,547 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-01-12 17:56:38,556 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 17:56:38,565 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-12 17:56:38,581 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-12 17:56:38,616 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 17:56:38,617 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 17:56:38,617 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 17:56:38,617 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 17:56:38,617 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 17:56:38,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 17:56:38,618 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 17:56:38,618 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 17:56:38,618 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 17:56:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states. [2019-01-12 17:56:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 17:56:38,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:38,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:38,664 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1203570768, now seen corresponding path program 1 times [2019-01-12 17:56:38,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:39,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:39,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:39,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:39,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:39,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:39,556 INFO L87 Difference]: Start difference. First operand 377 states. Second operand 4 states. [2019-01-12 17:56:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:40,200 INFO L93 Difference]: Finished difference Result 1100 states and 1983 transitions. [2019-01-12 17:56:40,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:40,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-01-12 17:56:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:40,238 INFO L225 Difference]: With dead ends: 1100 [2019-01-12 17:56:40,238 INFO L226 Difference]: Without dead ends: 726 [2019-01-12 17:56:40,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-01-12 17:56:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 701. [2019-01-12 17:56:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-01-12 17:56:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1004 transitions. [2019-01-12 17:56:40,376 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1004 transitions. Word has length 139 [2019-01-12 17:56:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:40,376 INFO L480 AbstractCegarLoop]: Abstraction has 701 states and 1004 transitions. [2019-01-12 17:56:40,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1004 transitions. [2019-01-12 17:56:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-12 17:56:40,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:40,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:40,390 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:40,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1141139268, now seen corresponding path program 1 times [2019-01-12 17:56:40,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:40,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:40,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:40,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:40,555 INFO L87 Difference]: Start difference. First operand 701 states and 1004 transitions. Second operand 3 states. [2019-01-12 17:56:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:40,722 INFO L93 Difference]: Finished difference Result 2065 states and 2950 transitions. [2019-01-12 17:56:40,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:56:40,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-01-12 17:56:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:40,731 INFO L225 Difference]: With dead ends: 2065 [2019-01-12 17:56:40,731 INFO L226 Difference]: Without dead ends: 1392 [2019-01-12 17:56:40,736 INFO L631 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-01-12 17:56:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-01-12 17:56:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 703. [2019-01-12 17:56:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-01-12 17:56:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1006 transitions. [2019-01-12 17:56:40,802 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1006 transitions. Word has length 140 [2019-01-12 17:56:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:40,802 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1006 transitions. [2019-01-12 17:56:40,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:56:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1006 transitions. [2019-01-12 17:56:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 17:56:40,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:40,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:40,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:40,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:40,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1084924930, now seen corresponding path program 1 times [2019-01-12 17:56:40,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:40,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:40,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:40,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:40,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:40,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:40,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:40,990 INFO L87 Difference]: Start difference. First operand 703 states and 1006 transitions. Second operand 3 states. [2019-01-12 17:56:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:41,443 INFO L93 Difference]: Finished difference Result 1889 states and 2711 transitions. [2019-01-12 17:56:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:56:41,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-01-12 17:56:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:41,451 INFO L225 Difference]: With dead ends: 1889 [2019-01-12 17:56:41,451 INFO L226 Difference]: Without dead ends: 1364 [2019-01-12 17:56:41,452 INFO L631 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-01-12 17:56:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-01-12 17:56:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1339. [2019-01-12 17:56:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-01-12 17:56:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1907 transitions. [2019-01-12 17:56:41,527 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1907 transitions. Word has length 141 [2019-01-12 17:56:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:41,528 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 1907 transitions. [2019-01-12 17:56:41,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:56:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1907 transitions. [2019-01-12 17:56:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 17:56:41,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:41,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:41,532 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash -980453119, now seen corresponding path program 1 times [2019-01-12 17:56:41,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:41,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:41,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:41,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:41,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:41,721 INFO L87 Difference]: Start difference. First operand 1339 states and 1907 transitions. Second operand 4 states. [2019-01-12 17:56:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:41,834 INFO L93 Difference]: Finished difference Result 2197 states and 3137 transitions. [2019-01-12 17:56:41,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:41,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-01-12 17:56:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:41,840 INFO L225 Difference]: With dead ends: 2197 [2019-01-12 17:56:41,840 INFO L226 Difference]: Without dead ends: 1026 [2019-01-12 17:56:41,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-01-12 17:56:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2019-01-12 17:56:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-01-12 17:56:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1453 transitions. [2019-01-12 17:56:41,922 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1453 transitions. Word has length 141 [2019-01-12 17:56:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:41,922 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1453 transitions. [2019-01-12 17:56:41,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1453 transitions. [2019-01-12 17:56:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 17:56:41,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:41,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:41,929 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1168757507, now seen corresponding path program 1 times [2019-01-12 17:56:41,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:41,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:41,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:42,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:42,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:42,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:42,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:42,092 INFO L87 Difference]: Start difference. First operand 1026 states and 1453 transitions. Second operand 3 states. [2019-01-12 17:56:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:45,277 INFO L93 Difference]: Finished difference Result 2646 states and 3788 transitions. [2019-01-12 17:56:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:56:45,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-01-12 17:56:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:45,287 INFO L225 Difference]: With dead ends: 2646 [2019-01-12 17:56:45,288 INFO L226 Difference]: Without dead ends: 1873 [2019-01-12 17:56:45,290 INFO L631 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-01-12 17:56:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-01-12 17:56:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1848. [2019-01-12 17:56:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-01-12 17:56:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2630 transitions. [2019-01-12 17:56:45,406 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2630 transitions. Word has length 147 [2019-01-12 17:56:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:45,407 INFO L480 AbstractCegarLoop]: Abstraction has 1848 states and 2630 transitions. [2019-01-12 17:56:45,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:56:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2630 transitions. [2019-01-12 17:56:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 17:56:45,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:45,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:45,413 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash 668575330, now seen corresponding path program 1 times [2019-01-12 17:56:45,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:45,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:45,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:45,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:45,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-01-12 17:56:45,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:45,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:45,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:45,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:45,648 INFO L87 Difference]: Start difference. First operand 1848 states and 2630 transitions. Second operand 4 states. [2019-01-12 17:56:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:46,941 INFO L93 Difference]: Finished difference Result 3382 states and 4978 transitions. [2019-01-12 17:56:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:46,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-01-12 17:56:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:46,956 INFO L225 Difference]: With dead ends: 3382 [2019-01-12 17:56:46,956 INFO L226 Difference]: Without dead ends: 2810 [2019-01-12 17:56:46,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-01-12 17:56:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2808. [2019-01-12 17:56:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-01-12 17:56:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4040 transitions. [2019-01-12 17:56:47,122 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4040 transitions. Word has length 147 [2019-01-12 17:56:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:47,122 INFO L480 AbstractCegarLoop]: Abstraction has 2808 states and 4040 transitions. [2019-01-12 17:56:47,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4040 transitions. [2019-01-12 17:56:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 17:56:47,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:47,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:47,130 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2048583783, now seen corresponding path program 1 times [2019-01-12 17:56:47,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:47,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:47,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:47,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:47,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:47,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:47,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:47,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:47,295 INFO L87 Difference]: Start difference. First operand 2808 states and 4040 transitions. Second operand 3 states. [2019-01-12 17:56:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:47,685 INFO L93 Difference]: Finished difference Result 5536 states and 8266 transitions. [2019-01-12 17:56:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:56:47,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-01-12 17:56:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:47,708 INFO L225 Difference]: With dead ends: 5536 [2019-01-12 17:56:47,708 INFO L226 Difference]: Without dead ends: 4451 [2019-01-12 17:56:47,712 INFO L631 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-01-12 17:56:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4451 states. [2019-01-12 17:56:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4451 to 4449. [2019-01-12 17:56:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4449 states. [2019-01-12 17:56:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 6493 transitions. [2019-01-12 17:56:47,969 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 6493 transitions. Word has length 147 [2019-01-12 17:56:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:47,970 INFO L480 AbstractCegarLoop]: Abstraction has 4449 states and 6493 transitions. [2019-01-12 17:56:47,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:56:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 6493 transitions. [2019-01-12 17:56:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 17:56:47,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:47,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:47,977 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash -101387384, now seen corresponding path program 1 times [2019-01-12 17:56:47,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:47,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:48,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:48,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:48,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:48,362 INFO L87 Difference]: Start difference. First operand 4449 states and 6493 transitions. Second operand 4 states. [2019-01-12 17:56:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:49,481 INFO L93 Difference]: Finished difference Result 11588 states and 16901 transitions. [2019-01-12 17:56:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:49,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-01-12 17:56:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:49,508 INFO L225 Difference]: With dead ends: 11588 [2019-01-12 17:56:49,508 INFO L226 Difference]: Without dead ends: 7158 [2019-01-12 17:56:49,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2019-01-12 17:56:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 7136. [2019-01-12 17:56:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-01-12 17:56:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 10302 transitions. [2019-01-12 17:56:49,988 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 10302 transitions. Word has length 147 [2019-01-12 17:56:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:49,988 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 10302 transitions. [2019-01-12 17:56:49,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 10302 transitions. [2019-01-12 17:56:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 17:56:49,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:49,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:49,998 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1272506948, now seen corresponding path program 1 times [2019-01-12 17:56:50,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:50,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:50,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:50,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:50,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:50,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:50,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:50,089 INFO L87 Difference]: Start difference. First operand 7136 states and 10302 transitions. Second operand 3 states. [2019-01-12 17:56:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:50,729 INFO L93 Difference]: Finished difference Result 20323 states and 29354 transitions. [2019-01-12 17:56:50,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:56:50,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-01-12 17:56:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:50,766 INFO L225 Difference]: With dead ends: 20323 [2019-01-12 17:56:50,767 INFO L226 Difference]: Without dead ends: 13660 [2019-01-12 17:56:50,778 INFO L631 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-01-12 17:56:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13660 states. [2019-01-12 17:56:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13660 to 13640. [2019-01-12 17:56:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13640 states. [2019-01-12 17:56:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13640 states to 13640 states and 19472 transitions. [2019-01-12 17:56:51,588 INFO L78 Accepts]: Start accepts. Automaton has 13640 states and 19472 transitions. Word has length 149 [2019-01-12 17:56:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:51,589 INFO L480 AbstractCegarLoop]: Abstraction has 13640 states and 19472 transitions. [2019-01-12 17:56:51,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:56:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13640 states and 19472 transitions. [2019-01-12 17:56:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 17:56:51,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:51,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:51,605 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash -235144953, now seen corresponding path program 1 times [2019-01-12 17:56:51,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:51,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:51,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:51,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:51,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:51,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:51,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:51,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:51,813 INFO L87 Difference]: Start difference. First operand 13640 states and 19472 transitions. Second operand 4 states. [2019-01-12 17:56:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:52,528 INFO L93 Difference]: Finished difference Result 21757 states and 31033 transitions. [2019-01-12 17:56:52,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:52,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-01-12 17:56:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:52,544 INFO L225 Difference]: With dead ends: 21757 [2019-01-12 17:56:52,544 INFO L226 Difference]: Without dead ends: 11111 [2019-01-12 17:56:52,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11111 states. [2019-01-12 17:56:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11111 to 11111. [2019-01-12 17:56:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11111 states. [2019-01-12 17:56:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11111 states to 11111 states and 15800 transitions. [2019-01-12 17:56:53,189 INFO L78 Accepts]: Start accepts. Automaton has 11111 states and 15800 transitions. Word has length 149 [2019-01-12 17:56:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:53,189 INFO L480 AbstractCegarLoop]: Abstraction has 11111 states and 15800 transitions. [2019-01-12 17:56:53,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 11111 states and 15800 transitions. [2019-01-12 17:56:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-12 17:56:53,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:53,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:53,202 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1597470439, now seen corresponding path program 1 times [2019-01-12 17:56:53,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:53,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:53,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:53,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 17:56:53,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:56:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:56:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:53,541 INFO L87 Difference]: Start difference. First operand 11111 states and 15800 transitions. Second operand 5 states. [2019-01-12 17:56:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:54,697 INFO L93 Difference]: Finished difference Result 22720 states and 32954 transitions. [2019-01-12 17:56:54,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:54,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-01-12 17:56:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:54,720 INFO L225 Difference]: With dead ends: 22720 [2019-01-12 17:56:54,720 INFO L226 Difference]: Without dead ends: 18034 [2019-01-12 17:56:54,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 17:56:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18034 states. [2019-01-12 17:56:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18034 to 18032. [2019-01-12 17:56:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18032 states. [2019-01-12 17:56:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18032 states to 18032 states and 25326 transitions. [2019-01-12 17:56:55,937 INFO L78 Accepts]: Start accepts. Automaton has 18032 states and 25326 transitions. Word has length 155 [2019-01-12 17:56:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:55,938 INFO L480 AbstractCegarLoop]: Abstraction has 18032 states and 25326 transitions. [2019-01-12 17:56:55,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:56:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18032 states and 25326 transitions. [2019-01-12 17:56:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-12 17:56:55,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:55,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:55,954 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1547996009, now seen corresponding path program 1 times [2019-01-12 17:56:55,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:55,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:56,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:56,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:56:56,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:56:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:56:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:56:56,263 INFO L87 Difference]: Start difference. First operand 18032 states and 25326 transitions. Second operand 4 states. [2019-01-12 17:56:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:56:58,104 INFO L93 Difference]: Finished difference Result 52790 states and 73908 transitions. [2019-01-12 17:56:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:56:58,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-01-12 17:56:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:56:58,131 INFO L225 Difference]: With dead ends: 52790 [2019-01-12 17:56:58,131 INFO L226 Difference]: Without dead ends: 34797 [2019-01-12 17:56:58,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:56:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34797 states. [2019-01-12 17:56:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34797 to 34753. [2019-01-12 17:56:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34753 states. [2019-01-12 17:56:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34753 states to 34753 states and 48111 transitions. [2019-01-12 17:56:59,897 INFO L78 Accepts]: Start accepts. Automaton has 34753 states and 48111 transitions. Word has length 155 [2019-01-12 17:56:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:56:59,897 INFO L480 AbstractCegarLoop]: Abstraction has 34753 states and 48111 transitions. [2019-01-12 17:56:59,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:56:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 34753 states and 48111 transitions. [2019-01-12 17:56:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 17:56:59,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:56:59,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:56:59,920 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:56:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:56:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1019371775, now seen corresponding path program 1 times [2019-01-12 17:56:59,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:56:59,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:56:59,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:59,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:56:59,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:56:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:56:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:56:59,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:56:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:56:59,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:56:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:56:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:56:59,984 INFO L87 Difference]: Start difference. First operand 34753 states and 48111 transitions. Second operand 3 states. [2019-01-12 17:57:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:57:02,927 INFO L93 Difference]: Finished difference Result 104067 states and 144084 transitions. [2019-01-12 17:57:02,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:57:02,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-01-12 17:57:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:57:03,210 INFO L225 Difference]: With dead ends: 104067 [2019-01-12 17:57:03,210 INFO L226 Difference]: Without dead ends: 69419 [2019-01-12 17:57:03,235 INFO L631 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-01-12 17:57:03,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69419 states. [2019-01-12 17:57:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69419 to 34759. [2019-01-12 17:57:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34759 states. [2019-01-12 17:57:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34759 states to 34759 states and 48117 transitions. [2019-01-12 17:57:05,165 INFO L78 Accepts]: Start accepts. Automaton has 34759 states and 48117 transitions. Word has length 156 [2019-01-12 17:57:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:57:05,165 INFO L480 AbstractCegarLoop]: Abstraction has 34759 states and 48117 transitions. [2019-01-12 17:57:05,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:57:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34759 states and 48117 transitions. [2019-01-12 17:57:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 17:57:05,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:57:05,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:57:05,185 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:57:05,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:57:05,185 INFO L82 PathProgramCache]: Analyzing trace with hash 234138742, now seen corresponding path program 1 times [2019-01-12 17:57:05,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:57:05,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:57:05,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:57:05,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:57:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:57:05,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:57:05,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:57:05,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:57:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:57:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:57:05,370 INFO L87 Difference]: Start difference. First operand 34759 states and 48117 transitions. Second operand 4 states. [2019-01-12 17:57:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:57:07,608 INFO L93 Difference]: Finished difference Result 69480 states and 96182 transitions. [2019-01-12 17:57:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:57:07,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-01-12 17:57:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:57:07,638 INFO L225 Difference]: With dead ends: 69480 [2019-01-12 17:57:07,639 INFO L226 Difference]: Without dead ends: 34753 [2019-01-12 17:57:07,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:57:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34753 states. [2019-01-12 17:57:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34753 to 34753. [2019-01-12 17:57:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34753 states. [2019-01-12 17:57:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34753 states to 34753 states and 48105 transitions. [2019-01-12 17:57:09,882 INFO L78 Accepts]: Start accepts. Automaton has 34753 states and 48105 transitions. Word has length 157 [2019-01-12 17:57:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:57:09,883 INFO L480 AbstractCegarLoop]: Abstraction has 34753 states and 48105 transitions. [2019-01-12 17:57:09,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:57:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 34753 states and 48105 transitions. [2019-01-12 17:57:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 17:57:09,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:57:09,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 17:57:09,899 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:57:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:57:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash -609898143, now seen corresponding path program 1 times [2019-01-12 17:57:09,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:57:09,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:57:09,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:09,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:57:09,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:57:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:57:10,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:57:10,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:57:10,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:57:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:57:10,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:57:10,017 INFO L87 Difference]: Start difference. First operand 34753 states and 48105 transitions. Second operand 3 states. [2019-01-12 17:57:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:57:12,520 INFO L93 Difference]: Finished difference Result 85369 states and 117906 transitions. [2019-01-12 17:57:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:57:12,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-01-12 17:57:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:57:12,566 INFO L225 Difference]: With dead ends: 85369 [2019-01-12 17:57:12,566 INFO L226 Difference]: Without dead ends: 51553 [2019-01-12 17:57:12,590 INFO L631 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-01-12 17:57:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51553 states. [2019-01-12 17:57:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51553 to 51509. [2019-01-12 17:57:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51509 states. [2019-01-12 17:57:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51509 states to 51509 states and 69966 transitions. [2019-01-12 17:57:15,553 INFO L78 Accepts]: Start accepts. Automaton has 51509 states and 69966 transitions. Word has length 157 [2019-01-12 17:57:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:57:15,554 INFO L480 AbstractCegarLoop]: Abstraction has 51509 states and 69966 transitions. [2019-01-12 17:57:15,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:57:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 51509 states and 69966 transitions. [2019-01-12 17:57:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:57:15,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:57:15,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:57:15,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:57:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:57:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash -941679734, now seen corresponding path program 1 times [2019-01-12 17:57:15,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:57:15,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:57:15,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:15,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:57:15,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:57:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:57:15,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:57:15,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 17:57:15,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 17:57:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 17:57:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 17:57:15,756 INFO L87 Difference]: Start difference. First operand 51509 states and 69966 transitions. Second operand 7 states. [2019-01-12 17:57:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:57:19,796 INFO L93 Difference]: Finished difference Result 96086 states and 130603 transitions. [2019-01-12 17:57:19,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 17:57:19,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2019-01-12 17:57:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:57:19,856 INFO L225 Difference]: With dead ends: 96086 [2019-01-12 17:57:19,856 INFO L226 Difference]: Without dead ends: 51509 [2019-01-12 17:57:19,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 17:57:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51509 states. [2019-01-12 17:57:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51509 to 51509. [2019-01-12 17:57:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51509 states. [2019-01-12 17:57:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51509 states to 51509 states and 69054 transitions. [2019-01-12 17:57:24,212 INFO L78 Accepts]: Start accepts. Automaton has 51509 states and 69054 transitions. Word has length 163 [2019-01-12 17:57:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:57:24,213 INFO L480 AbstractCegarLoop]: Abstraction has 51509 states and 69054 transitions. [2019-01-12 17:57:24,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 17:57:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 51509 states and 69054 transitions. [2019-01-12 17:57:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:57:24,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:57:24,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:57:24,242 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:57:24,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:57:24,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1530284517, now seen corresponding path program 1 times [2019-01-12 17:57:24,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:57:24,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:57:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:24,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:57:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:57:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:57:24,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:57:24,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-12 17:57:24,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 17:57:24,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 17:57:24,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-01-12 17:57:24,807 INFO L87 Difference]: Start difference. First operand 51509 states and 69054 transitions. Second operand 14 states. [2019-01-12 17:57:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:57:34,831 INFO L93 Difference]: Finished difference Result 108310 states and 150863 transitions. [2019-01-12 17:57:34,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 17:57:34,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 163 [2019-01-12 17:57:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:57:34,911 INFO L225 Difference]: With dead ends: 108310 [2019-01-12 17:57:34,911 INFO L226 Difference]: Without dead ends: 96694 [2019-01-12 17:57:34,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-01-12 17:57:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96694 states. [2019-01-12 17:57:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96694 to 55035. [2019-01-12 17:57:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55035 states. [2019-01-12 17:57:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55035 states to 55035 states and 73181 transitions. [2019-01-12 17:57:39,072 INFO L78 Accepts]: Start accepts. Automaton has 55035 states and 73181 transitions. Word has length 163 [2019-01-12 17:57:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:57:39,073 INFO L480 AbstractCegarLoop]: Abstraction has 55035 states and 73181 transitions. [2019-01-12 17:57:39,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 17:57:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 55035 states and 73181 transitions. [2019-01-12 17:57:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:57:39,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:57:39,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:57:39,097 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:57:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:57:39,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1031482021, now seen corresponding path program 1 times [2019-01-12 17:57:39,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:57:39,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:57:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:57:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:57:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:57:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:57:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-12 17:57:39,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 17:57:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 17:57:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-01-12 17:57:39,501 INFO L87 Difference]: Start difference. First operand 55035 states and 73181 transitions. Second operand 14 states. [2019-01-12 17:57:39,676 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2019-01-12 17:57:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:57:52,616 INFO L93 Difference]: Finished difference Result 132857 states and 182579 transitions. [2019-01-12 17:57:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 17:57:52,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 163 [2019-01-12 17:57:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:57:52,719 INFO L225 Difference]: With dead ends: 132857 [2019-01-12 17:57:52,719 INFO L226 Difference]: Without dead ends: 125039 [2019-01-12 17:57:52,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 17:57:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125039 states. [2019-01-12 17:57:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125039 to 60487. [2019-01-12 17:57:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60487 states. [2019-01-12 17:57:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60487 states to 60487 states and 79479 transitions. [2019-01-12 17:57:58,456 INFO L78 Accepts]: Start accepts. Automaton has 60487 states and 79479 transitions. Word has length 163 [2019-01-12 17:57:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:57:58,456 INFO L480 AbstractCegarLoop]: Abstraction has 60487 states and 79479 transitions. [2019-01-12 17:57:58,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 17:57:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60487 states and 79479 transitions. [2019-01-12 17:57:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:57:58,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:57:58,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:57:58,482 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:57:58,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:57:58,482 INFO L82 PathProgramCache]: Analyzing trace with hash 888809919, now seen corresponding path program 1 times [2019-01-12 17:57:58,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:57:58,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:57:58,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:58,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:57:58,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:57:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:57:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:57:58,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:57:58,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 17:57:58,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 17:57:58,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 17:57:58,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:57:58,753 INFO L87 Difference]: Start difference. First operand 60487 states and 79479 transitions. Second operand 5 states. [2019-01-12 17:58:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:58:04,103 INFO L93 Difference]: Finished difference Result 83631 states and 114464 transitions. [2019-01-12 17:58:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:58:04,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-01-12 17:58:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:58:04,148 INFO L225 Difference]: With dead ends: 83631 [2019-01-12 17:58:04,148 INFO L226 Difference]: Without dead ends: 60381 [2019-01-12 17:58:04,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 17:58:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60381 states. [2019-01-12 17:58:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60381 to 60379. [2019-01-12 17:58:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60379 states. [2019-01-12 17:58:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60379 states to 60379 states and 78999 transitions. [2019-01-12 17:58:09,653 INFO L78 Accepts]: Start accepts. Automaton has 60379 states and 78999 transitions. Word has length 163 [2019-01-12 17:58:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:58:09,654 INFO L480 AbstractCegarLoop]: Abstraction has 60379 states and 78999 transitions. [2019-01-12 17:58:09,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 17:58:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 60379 states and 78999 transitions. [2019-01-12 17:58:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:58:09,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:58:09,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:58:09,678 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:58:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:58:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash 292054911, now seen corresponding path program 1 times [2019-01-12 17:58:09,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:58:09,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:58:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:58:09,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:58:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:58:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:58:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:58:10,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:58:10,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-12 17:58:10,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 17:58:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 17:58:10,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-12 17:58:10,101 INFO L87 Difference]: Start difference. First operand 60379 states and 78999 transitions. Second operand 15 states. [2019-01-12 17:58:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:58:20,179 INFO L93 Difference]: Finished difference Result 83308 states and 111504 transitions. [2019-01-12 17:58:20,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 17:58:20,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 163 [2019-01-12 17:58:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:58:20,246 INFO L225 Difference]: With dead ends: 83308 [2019-01-12 17:58:20,246 INFO L226 Difference]: Without dead ends: 81294 [2019-01-12 17:58:20,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-01-12 17:58:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81294 states. [2019-01-12 17:58:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81294 to 62679. [2019-01-12 17:58:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62679 states. [2019-01-12 17:58:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62679 states to 62679 states and 81707 transitions. [2019-01-12 17:58:26,588 INFO L78 Accepts]: Start accepts. Automaton has 62679 states and 81707 transitions. Word has length 163 [2019-01-12 17:58:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:58:26,588 INFO L480 AbstractCegarLoop]: Abstraction has 62679 states and 81707 transitions. [2019-01-12 17:58:26,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 17:58:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62679 states and 81707 transitions. [2019-01-12 17:58:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:58:26,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:58:26,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:58:26,616 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:58:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:58:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash -206747585, now seen corresponding path program 1 times [2019-01-12 17:58:26,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:58:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:58:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:58:26,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:58:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:58:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:58:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:58:26,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:58:26,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:58:26,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:58:26,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:58:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:58:26,737 INFO L87 Difference]: Start difference. First operand 62679 states and 81707 transitions. Second operand 3 states. [2019-01-12 17:58:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:58:32,873 INFO L93 Difference]: Finished difference Result 78199 states and 104960 transitions. [2019-01-12 17:58:32,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:58:32,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-01-12 17:58:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:58:32,925 INFO L225 Difference]: With dead ends: 78199 [2019-01-12 17:58:32,926 INFO L226 Difference]: Without dead ends: 62681 [2019-01-12 17:58:32,939 INFO L631 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-01-12 17:58:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62681 states. [2019-01-12 17:58:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62681 to 62499. [2019-01-12 17:58:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62499 states. [2019-01-12 17:58:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62499 states to 62499 states and 81239 transitions. [2019-01-12 17:58:39,157 INFO L78 Accepts]: Start accepts. Automaton has 62499 states and 81239 transitions. Word has length 163 [2019-01-12 17:58:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:58:39,157 INFO L480 AbstractCegarLoop]: Abstraction has 62499 states and 81239 transitions. [2019-01-12 17:58:39,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:58:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 62499 states and 81239 transitions. [2019-01-12 17:58:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:58:39,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:58:39,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:58:39,184 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:58:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:58:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1718110737, now seen corresponding path program 1 times [2019-01-12 17:58:39,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:58:39,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:58:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:58:39,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:58:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:58:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:58:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:58:39,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:58:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 17:58:39,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 17:58:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 17:58:39,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-01-12 17:58:39,952 INFO L87 Difference]: Start difference. First operand 62499 states and 81239 transitions. Second operand 18 states. [2019-01-12 17:58:40,104 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-01-12 17:58:42,066 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-01-12 17:58:42,397 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-01-12 17:58:42,845 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-12 17:58:43,796 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-01-12 17:58:45,889 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-01-12 17:58:47,505 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-01-12 17:58:48,021 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-12 17:58:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:58:58,025 INFO L93 Difference]: Finished difference Result 113615 states and 149117 transitions. [2019-01-12 17:58:58,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 17:58:58,026 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 163 [2019-01-12 17:58:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:58:58,120 INFO L225 Difference]: With dead ends: 113615 [2019-01-12 17:58:58,120 INFO L226 Difference]: Without dead ends: 111790 [2019-01-12 17:58:58,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=446, Invalid=1360, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 17:58:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111790 states. [2019-01-12 17:59:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111790 to 71529. [2019-01-12 17:59:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71529 states. [2019-01-12 17:59:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71529 states to 71529 states and 91844 transitions. [2019-01-12 17:59:06,368 INFO L78 Accepts]: Start accepts. Automaton has 71529 states and 91844 transitions. Word has length 163 [2019-01-12 17:59:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:59:06,369 INFO L480 AbstractCegarLoop]: Abstraction has 71529 states and 91844 transitions. [2019-01-12 17:59:06,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 17:59:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 71529 states and 91844 transitions. [2019-01-12 17:59:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:59:06,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:59:06,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:59:06,405 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:59:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:59:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2067607009, now seen corresponding path program 1 times [2019-01-12 17:59:06,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:59:06,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:59:06,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:59:06,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:59:06,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:59:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:59:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:59:06,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:59:06,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 17:59:06,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 17:59:06,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 17:59:06,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 17:59:06,545 INFO L87 Difference]: Start difference. First operand 71529 states and 91844 transitions. Second operand 3 states. [2019-01-12 17:59:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:59:14,333 INFO L93 Difference]: Finished difference Result 85825 states and 113297 transitions. [2019-01-12 17:59:14,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 17:59:14,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-01-12 17:59:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:59:14,391 INFO L225 Difference]: With dead ends: 85825 [2019-01-12 17:59:14,391 INFO L226 Difference]: Without dead ends: 71531 [2019-01-12 17:59:14,412 INFO L631 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-01-12 17:59:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71531 states. [2019-01-12 17:59:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71531 to 71341. [2019-01-12 17:59:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71341 states. [2019-01-12 17:59:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71341 states to 71341 states and 91415 transitions. [2019-01-12 17:59:22,528 INFO L78 Accepts]: Start accepts. Automaton has 71341 states and 91415 transitions. Word has length 163 [2019-01-12 17:59:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:59:22,528 INFO L480 AbstractCegarLoop]: Abstraction has 71341 states and 91415 transitions. [2019-01-12 17:59:22,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 17:59:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 71341 states and 91415 transitions. [2019-01-12 17:59:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 17:59:22,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:59:22,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:59:22,566 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:59:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:59:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2068037985, now seen corresponding path program 1 times [2019-01-12 17:59:22,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:59:22,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:59:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:59:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:59:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:59:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:59:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:59:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:59:22,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 17:59:22,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 17:59:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 17:59:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 17:59:22,852 INFO L87 Difference]: Start difference. First operand 71341 states and 91415 transitions. Second operand 4 states. [2019-01-12 17:59:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:59:30,343 INFO L93 Difference]: Finished difference Result 134830 states and 172527 transitions. [2019-01-12 17:59:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 17:59:30,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-01-12 17:59:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:59:30,395 INFO L225 Difference]: With dead ends: 134830 [2019-01-12 17:59:30,395 INFO L226 Difference]: Without dead ends: 64018 [2019-01-12 17:59:30,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 17:59:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64018 states. [2019-01-12 17:59:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64018 to 63838. [2019-01-12 17:59:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63838 states. [2019-01-12 17:59:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63838 states to 63838 states and 81503 transitions. [2019-01-12 17:59:37,809 INFO L78 Accepts]: Start accepts. Automaton has 63838 states and 81503 transitions. Word has length 163 [2019-01-12 17:59:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 17:59:37,809 INFO L480 AbstractCegarLoop]: Abstraction has 63838 states and 81503 transitions. [2019-01-12 17:59:37,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 17:59:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 63838 states and 81503 transitions. [2019-01-12 17:59:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 17:59:37,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 17:59:37,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 17:59:37,843 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 17:59:37,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 17:59:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash 652438755, now seen corresponding path program 1 times [2019-01-12 17:59:37,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 17:59:37,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 17:59:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:59:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 17:59:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 17:59:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 17:59:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 17:59:38,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 17:59:38,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 17:59:38,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 17:59:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 17:59:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-12 17:59:38,249 INFO L87 Difference]: Start difference. First operand 63838 states and 81503 transitions. Second operand 13 states. [2019-01-12 17:59:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 17:59:53,629 INFO L93 Difference]: Finished difference Result 113549 states and 149679 transitions. [2019-01-12 17:59:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 17:59:53,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 165 [2019-01-12 17:59:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 17:59:53,718 INFO L225 Difference]: With dead ends: 113549 [2019-01-12 17:59:53,718 INFO L226 Difference]: Without dead ends: 104275 [2019-01-12 17:59:53,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=928, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 17:59:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104275 states. [2019-01-12 18:00:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104275 to 71733. [2019-01-12 18:00:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71733 states. [2019-01-12 18:00:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71733 states to 71733 states and 90983 transitions. [2019-01-12 18:00:02,468 INFO L78 Accepts]: Start accepts. Automaton has 71733 states and 90983 transitions. Word has length 165 [2019-01-12 18:00:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:00:02,469 INFO L480 AbstractCegarLoop]: Abstraction has 71733 states and 90983 transitions. [2019-01-12 18:00:02,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 18:00:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 71733 states and 90983 transitions. [2019-01-12 18:00:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 18:00:02,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:00:02,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:00:02,509 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:00:02,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:00:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1711717342, now seen corresponding path program 1 times [2019-01-12 18:00:02,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:00:02,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:00:02,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:00:02,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:00:02,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:00:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:00:03,224 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-12 18:00:03,346 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2019-01-12 18:00:03,687 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-12 18:00:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:00:04,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:00:04,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-01-12 18:00:04,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 18:00:04,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 18:00:04,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-01-12 18:00:04,769 INFO L87 Difference]: Start difference. First operand 71733 states and 90983 transitions. Second operand 26 states. [2019-01-12 18:00:05,743 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-01-12 18:00:06,569 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-12 18:00:06,960 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-01-12 18:00:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:00:21,842 INFO L93 Difference]: Finished difference Result 92938 states and 117577 transitions. [2019-01-12 18:00:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 18:00:21,844 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 165 [2019-01-12 18:00:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:00:21,910 INFO L225 Difference]: With dead ends: 92938 [2019-01-12 18:00:21,910 INFO L226 Difference]: Without dead ends: 85962 [2019-01-12 18:00:21,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 18:00:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85962 states. [2019-01-12 18:00:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85962 to 73828. [2019-01-12 18:00:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73828 states. [2019-01-12 18:00:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73828 states to 73828 states and 93488 transitions. [2019-01-12 18:00:31,302 INFO L78 Accepts]: Start accepts. Automaton has 73828 states and 93488 transitions. Word has length 165 [2019-01-12 18:00:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:00:31,303 INFO L480 AbstractCegarLoop]: Abstraction has 73828 states and 93488 transitions. [2019-01-12 18:00:31,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 18:00:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 73828 states and 93488 transitions. [2019-01-12 18:00:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 18:00:31,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:00:31,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:00:31,345 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:00:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:00:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1436756498, now seen corresponding path program 1 times [2019-01-12 18:00:31,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:00:31,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:00:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:00:31,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:00:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:00:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:00:31,935 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 18:00:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:00:32,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:00:32,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 18:00:32,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 18:00:32,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 18:00:32,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-12 18:00:32,262 INFO L87 Difference]: Start difference. First operand 73828 states and 93488 transitions. Second operand 13 states. [2019-01-12 18:00:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:00:53,390 INFO L93 Difference]: Finished difference Result 136917 states and 176837 transitions. [2019-01-12 18:00:53,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 18:00:53,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 165 [2019-01-12 18:00:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:00:53,503 INFO L225 Difference]: With dead ends: 136917 [2019-01-12 18:00:53,503 INFO L226 Difference]: Without dead ends: 133041 [2019-01-12 18:00:53,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2019-01-12 18:00:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133041 states. [2019-01-12 18:01:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133041 to 86516. [2019-01-12 18:01:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86516 states. [2019-01-12 18:01:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86516 states to 86516 states and 108280 transitions. [2019-01-12 18:01:07,109 INFO L78 Accepts]: Start accepts. Automaton has 86516 states and 108280 transitions. Word has length 165 [2019-01-12 18:01:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:01:07,109 INFO L480 AbstractCegarLoop]: Abstraction has 86516 states and 108280 transitions. [2019-01-12 18:01:07,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 18:01:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 86516 states and 108280 transitions. [2019-01-12 18:01:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 18:01:07,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:01:07,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:01:07,157 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:01:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:01:07,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1646485686, now seen corresponding path program 1 times [2019-01-12 18:01:07,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:01:07,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:01:07,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:01:07,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:01:07,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:01:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:01:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:01:08,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:01:08,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 18:01:08,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 18:01:08,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 18:01:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-01-12 18:01:08,481 INFO L87 Difference]: Start difference. First operand 86516 states and 108280 transitions. Second operand 20 states. [2019-01-12 18:01:19,598 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-12 18:01:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:01:26,167 INFO L93 Difference]: Finished difference Result 107913 states and 136535 transitions. [2019-01-12 18:01:26,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 18:01:26,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 165 [2019-01-12 18:01:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:01:26,249 INFO L225 Difference]: With dead ends: 107913 [2019-01-12 18:01:26,249 INFO L226 Difference]: Without dead ends: 100668 [2019-01-12 18:01:26,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 18:01:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100668 states. [2019-01-12 18:01:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100668 to 90158. [2019-01-12 18:01:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90158 states. [2019-01-12 18:01:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90158 states to 90158 states and 112498 transitions. [2019-01-12 18:01:38,625 INFO L78 Accepts]: Start accepts. Automaton has 90158 states and 112498 transitions. Word has length 165 [2019-01-12 18:01:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:01:38,625 INFO L480 AbstractCegarLoop]: Abstraction has 90158 states and 112498 transitions. [2019-01-12 18:01:38,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 18:01:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 90158 states and 112498 transitions. [2019-01-12 18:01:38,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 18:01:38,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:01:38,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:01:38,675 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:01:38,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:01:38,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1954718549, now seen corresponding path program 1 times [2019-01-12 18:01:38,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:01:38,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:01:38,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:01:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:01:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:01:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:01:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:01:38,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:01:38,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 18:01:38,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 18:01:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 18:01:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 18:01:38,991 INFO L87 Difference]: Start difference. First operand 90158 states and 112498 transitions. Second operand 7 states. [2019-01-12 18:01:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:01:49,138 INFO L93 Difference]: Finished difference Result 139318 states and 175334 transitions. [2019-01-12 18:01:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 18:01:49,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-01-12 18:01:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:01:49,209 INFO L225 Difference]: With dead ends: 139318 [2019-01-12 18:01:49,210 INFO L226 Difference]: Without dead ends: 65510 [2019-01-12 18:01:49,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 18:01:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65510 states. [2019-01-12 18:01:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65510 to 60162. [2019-01-12 18:01:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60162 states. [2019-01-12 18:01:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60162 states to 60162 states and 73746 transitions. [2019-01-12 18:01:58,556 INFO L78 Accepts]: Start accepts. Automaton has 60162 states and 73746 transitions. Word has length 165 [2019-01-12 18:01:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:01:58,556 INFO L480 AbstractCegarLoop]: Abstraction has 60162 states and 73746 transitions. [2019-01-12 18:01:58,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 18:01:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 60162 states and 73746 transitions. [2019-01-12 18:01:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 18:01:58,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:01:58,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:01:58,590 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:01:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:01:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2038634566, now seen corresponding path program 1 times [2019-01-12 18:01:58,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:01:58,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:01:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:01:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:01:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:01:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:01:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:01:59,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:01:59,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-12 18:01:59,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 18:01:59,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 18:01:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-01-12 18:01:59,249 INFO L87 Difference]: Start difference. First operand 60162 states and 73746 transitions. Second operand 15 states. [2019-01-12 18:02:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:02:19,544 INFO L93 Difference]: Finished difference Result 105827 states and 131630 transitions. [2019-01-12 18:02:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 18:02:19,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 165 [2019-01-12 18:02:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:02:19,622 INFO L225 Difference]: With dead ends: 105827 [2019-01-12 18:02:19,622 INFO L226 Difference]: Without dead ends: 104639 [2019-01-12 18:02:19,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=296, Invalid=894, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 18:02:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104639 states. [2019-01-12 18:02:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104639 to 63440. [2019-01-12 18:02:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63440 states. [2019-01-12 18:02:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63440 states to 63440 states and 77528 transitions. [2019-01-12 18:02:30,073 INFO L78 Accepts]: Start accepts. Automaton has 63440 states and 77528 transitions. Word has length 165 [2019-01-12 18:02:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:02:30,073 INFO L480 AbstractCegarLoop]: Abstraction has 63440 states and 77528 transitions. [2019-01-12 18:02:30,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 18:02:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 63440 states and 77528 transitions. [2019-01-12 18:02:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 18:02:30,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:02:30,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:02:30,110 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:02:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:02:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1757530234, now seen corresponding path program 1 times [2019-01-12 18:02:30,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:02:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:02:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:02:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:02:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:02:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:02:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:02:30,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:02:30,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 18:02:30,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 18:02:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 18:02:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-01-12 18:02:30,566 INFO L87 Difference]: Start difference. First operand 63440 states and 77528 transitions. Second operand 16 states. [2019-01-12 18:02:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:02:50,676 INFO L93 Difference]: Finished difference Result 103996 states and 128031 transitions. [2019-01-12 18:02:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 18:02:50,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 165 [2019-01-12 18:02:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:02:50,754 INFO L225 Difference]: With dead ends: 103996 [2019-01-12 18:02:50,754 INFO L226 Difference]: Without dead ends: 100792 [2019-01-12 18:02:50,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 18:02:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100792 states. [2019-01-12 18:03:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100792 to 64507. [2019-01-12 18:03:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64507 states. [2019-01-12 18:03:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64507 states to 64507 states and 78755 transitions. [2019-01-12 18:03:01,889 INFO L78 Accepts]: Start accepts. Automaton has 64507 states and 78755 transitions. Word has length 165 [2019-01-12 18:03:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:03:01,889 INFO L480 AbstractCegarLoop]: Abstraction has 64507 states and 78755 transitions. [2019-01-12 18:03:01,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 18:03:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 64507 states and 78755 transitions. [2019-01-12 18:03:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 18:03:01,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:03:01,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:03:01,927 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:03:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:03:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1479690337, now seen corresponding path program 1 times [2019-01-12 18:03:01,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:03:01,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:03:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:03:01,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:03:01,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:03:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:03:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:03:02,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:03:02,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 18:03:02,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 18:03:02,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 18:03:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 18:03:02,206 INFO L87 Difference]: Start difference. First operand 64507 states and 78755 transitions. Second operand 4 states. [2019-01-12 18:03:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:03:13,272 INFO L93 Difference]: Finished difference Result 129615 states and 158225 transitions. [2019-01-12 18:03:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 18:03:13,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-01-12 18:03:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:03:13,321 INFO L225 Difference]: With dead ends: 129615 [2019-01-12 18:03:13,322 INFO L226 Difference]: Without dead ends: 65259 [2019-01-12 18:03:13,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 18:03:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65259 states. [2019-01-12 18:03:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65259 to 64767. [2019-01-12 18:03:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64767 states. [2019-01-12 18:03:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64767 states to 64767 states and 79039 transitions. [2019-01-12 18:03:24,494 INFO L78 Accepts]: Start accepts. Automaton has 64767 states and 79039 transitions. Word has length 165 [2019-01-12 18:03:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:03:24,494 INFO L480 AbstractCegarLoop]: Abstraction has 64767 states and 79039 transitions. [2019-01-12 18:03:24,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 18:03:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 64767 states and 79039 transitions. [2019-01-12 18:03:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-12 18:03:24,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:03:24,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:03:24,532 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:03:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:03:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash -38746671, now seen corresponding path program 1 times [2019-01-12 18:03:24,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:03:24,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:03:24,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:03:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:03:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:03:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:03:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:03:24,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:03:24,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 18:03:24,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 18:03:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 18:03:24,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 18:03:24,617 INFO L87 Difference]: Start difference. First operand 64767 states and 79039 transitions. Second operand 3 states. [2019-01-12 18:03:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:03:46,817 INFO L93 Difference]: Finished difference Result 183658 states and 223834 transitions. [2019-01-12 18:03:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 18:03:46,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-01-12 18:03:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:03:46,920 INFO L225 Difference]: With dead ends: 183658 [2019-01-12 18:03:46,920 INFO L226 Difference]: Without dead ends: 129333 [2019-01-12 18:03:46,951 INFO L631 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-01-12 18:03:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129333 states. [2019-01-12 18:03:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129333 to 64777. [2019-01-12 18:03:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64777 states. [2019-01-12 18:03:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64777 states to 64777 states and 79049 transitions. [2019-01-12 18:03:58,950 INFO L78 Accepts]: Start accepts. Automaton has 64777 states and 79049 transitions. Word has length 166 [2019-01-12 18:03:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:03:58,951 INFO L480 AbstractCegarLoop]: Abstraction has 64777 states and 79049 transitions. [2019-01-12 18:03:58,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 18:03:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 64777 states and 79049 transitions. [2019-01-12 18:03:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 18:03:58,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:03:58,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:03:58,991 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:03:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:03:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash -625080728, now seen corresponding path program 1 times [2019-01-12 18:03:58,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:03:58,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:03:58,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:03:58,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:03:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:03:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:04:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:04:00,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:04:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-12 18:04:00,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 18:04:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 18:04:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-01-12 18:04:00,504 INFO L87 Difference]: Start difference. First operand 64777 states and 79049 transitions. Second operand 21 states. [2019-01-12 18:04:01,913 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-12 18:04:02,163 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-01-12 18:04:02,452 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-01-12 18:04:03,602 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-01-12 18:04:05,418 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2019-01-12 18:04:08,084 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-01-12 18:04:08,502 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-01-12 18:04:11,669 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-01-12 18:04:12,137 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-01-12 18:04:15,474 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-01-12 18:04:17,553 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-01-12 18:04:22,302 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-01-12 18:04:25,764 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-01-12 18:04:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:04:29,320 INFO L93 Difference]: Finished difference Result 90182 states and 112458 transitions. [2019-01-12 18:04:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-12 18:04:29,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2019-01-12 18:04:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:04:29,383 INFO L225 Difference]: With dead ends: 90182 [2019-01-12 18:04:29,383 INFO L226 Difference]: Without dead ends: 87838 [2019-01-12 18:04:29,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=586, Invalid=2606, Unknown=0, NotChecked=0, Total=3192 [2019-01-12 18:04:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87838 states. [2019-01-12 18:04:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87838 to 67918. [2019-01-12 18:04:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67918 states. [2019-01-12 18:04:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67918 states to 67918 states and 82760 transitions. [2019-01-12 18:04:42,562 INFO L78 Accepts]: Start accepts. Automaton has 67918 states and 82760 transitions. Word has length 167 [2019-01-12 18:04:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:04:42,563 INFO L480 AbstractCegarLoop]: Abstraction has 67918 states and 82760 transitions. [2019-01-12 18:04:42,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 18:04:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 67918 states and 82760 transitions. [2019-01-12 18:04:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 18:04:42,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:04:42,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:04:42,606 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:04:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:04:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash -902920625, now seen corresponding path program 1 times [2019-01-12 18:04:42,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:04:42,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:04:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:04:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:04:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:04:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:04:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:04:42,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:04:42,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 18:04:42,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 18:04:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 18:04:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 18:04:42,907 INFO L87 Difference]: Start difference. First operand 67918 states and 82760 transitions. Second operand 4 states. [2019-01-12 18:04:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:04:56,642 INFO L93 Difference]: Finished difference Result 136634 states and 166504 transitions. [2019-01-12 18:04:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 18:04:56,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-01-12 18:04:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:04:56,696 INFO L225 Difference]: With dead ends: 136634 [2019-01-12 18:04:56,696 INFO L226 Difference]: Without dead ends: 69273 [2019-01-12 18:04:56,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 18:04:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69273 states. [2019-01-12 18:05:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69273 to 68356. [2019-01-12 18:05:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68356 states. [2019-01-12 18:05:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68356 states to 68356 states and 83240 transitions. [2019-01-12 18:05:10,160 INFO L78 Accepts]: Start accepts. Automaton has 68356 states and 83240 transitions. Word has length 167 [2019-01-12 18:05:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:05:10,161 INFO L480 AbstractCegarLoop]: Abstraction has 68356 states and 83240 transitions. [2019-01-12 18:05:10,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 18:05:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 68356 states and 83240 transitions. [2019-01-12 18:05:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 18:05:10,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:05:10,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:05:10,201 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:05:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:05:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash -958768768, now seen corresponding path program 1 times [2019-01-12 18:05:10,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:05:10,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:05:10,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:05:10,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:05:10,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:05:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:05:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:05:10,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:05:10,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 18:05:10,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 18:05:10,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 18:05:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 18:05:10,346 INFO L87 Difference]: Start difference. First operand 68356 states and 83240 transitions. Second operand 4 states. [2019-01-12 18:05:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:05:21,729 INFO L93 Difference]: Finished difference Result 105877 states and 128434 transitions. [2019-01-12 18:05:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 18:05:21,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-01-12 18:05:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:05:21,773 INFO L225 Difference]: With dead ends: 105877 [2019-01-12 18:05:21,773 INFO L226 Difference]: Without dead ends: 57910 [2019-01-12 18:05:21,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 18:05:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57910 states. [2019-01-12 18:05:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57910 to 57910. [2019-01-12 18:05:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57910 states. [2019-01-12 18:05:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57910 states to 57910 states and 70636 transitions. [2019-01-12 18:05:33,255 INFO L78 Accepts]: Start accepts. Automaton has 57910 states and 70636 transitions. Word has length 167 [2019-01-12 18:05:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:05:33,255 INFO L480 AbstractCegarLoop]: Abstraction has 57910 states and 70636 transitions. [2019-01-12 18:05:33,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 18:05:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 57910 states and 70636 transitions. [2019-01-12 18:05:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 18:05:33,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:05:33,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:05:33,288 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:05:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:05:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash -500061835, now seen corresponding path program 1 times [2019-01-12 18:05:33,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:05:33,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:05:33,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:05:33,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:05:33,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:05:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:05:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:05:33,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:05:33,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 18:05:33,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 18:05:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 18:05:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 18:05:33,354 INFO L87 Difference]: Start difference. First operand 57910 states and 70636 transitions. Second operand 3 states. [2019-01-12 18:05:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:05:52,478 INFO L93 Difference]: Finished difference Result 129077 states and 158458 transitions. [2019-01-12 18:05:52,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 18:05:52,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-01-12 18:05:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:05:52,562 INFO L225 Difference]: With dead ends: 129077 [2019-01-12 18:05:52,563 INFO L226 Difference]: Without dead ends: 96775 [2019-01-12 18:05:52,583 INFO L631 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-01-12 18:05:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96775 states. [2019-01-12 18:06:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96775 to 94153. [2019-01-12 18:06:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94153 states. [2019-01-12 18:06:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94153 states to 94153 states and 114474 transitions. [2019-01-12 18:06:11,896 INFO L78 Accepts]: Start accepts. Automaton has 94153 states and 114474 transitions. Word has length 169 [2019-01-12 18:06:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:06:11,897 INFO L480 AbstractCegarLoop]: Abstraction has 94153 states and 114474 transitions. [2019-01-12 18:06:11,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 18:06:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 94153 states and 114474 transitions. [2019-01-12 18:06:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 18:06:11,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:06:11,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:06:11,949 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:06:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:06:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 164217648, now seen corresponding path program 1 times [2019-01-12 18:06:11,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:06:11,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:06:11,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:06:11,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:06:11,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:06:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:06:12,233 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 18:06:12,629 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-12 18:06:12,815 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-12 18:06:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:06:14,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:06:14,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-01-12 18:06:14,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 18:06:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 18:06:14,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-01-12 18:06:14,848 INFO L87 Difference]: Start difference. First operand 94153 states and 114474 transitions. Second operand 25 states. [2019-01-12 18:06:15,683 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-12 18:06:17,493 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-12 18:06:33,691 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-01-12 18:06:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:06:44,096 INFO L93 Difference]: Finished difference Result 107251 states and 131070 transitions. [2019-01-12 18:06:44,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 18:06:44,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 169 [2019-01-12 18:06:44,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:06:44,173 INFO L225 Difference]: With dead ends: 107251 [2019-01-12 18:06:44,174 INFO L226 Difference]: Without dead ends: 102629 [2019-01-12 18:06:44,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=628, Invalid=2452, Unknown=0, NotChecked=0, Total=3080 [2019-01-12 18:06:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102629 states. [2019-01-12 18:07:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102629 to 95691. [2019-01-12 18:07:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95691 states. [2019-01-12 18:07:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95691 states to 95691 states and 116276 transitions. [2019-01-12 18:07:04,741 INFO L78 Accepts]: Start accepts. Automaton has 95691 states and 116276 transitions. Word has length 169 [2019-01-12 18:07:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:07:04,742 INFO L480 AbstractCegarLoop]: Abstraction has 95691 states and 116276 transitions. [2019-01-12 18:07:04,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 18:07:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 95691 states and 116276 transitions. [2019-01-12 18:07:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 18:07:04,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:07:04,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:07:04,796 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:07:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:07:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2043426375, now seen corresponding path program 1 times [2019-01-12 18:07:04,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:07:04,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:07:04,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:07:04,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:07:04,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:07:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 18:07:05,398 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2019-01-12 18:07:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 18:07:05,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 18:07:05,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 18:07:05,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 18:07:05,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 18:07:05,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-01-12 18:07:05,791 INFO L87 Difference]: Start difference. First operand 95691 states and 116276 transitions. Second operand 20 states. [2019-01-12 18:07:05,939 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-12 18:07:18,087 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-12 18:07:18,724 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-01-12 18:07:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 18:07:40,373 INFO L93 Difference]: Finished difference Result 129131 states and 157712 transitions. [2019-01-12 18:07:40,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 18:07:40,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 169 [2019-01-12 18:07:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 18:07:40,467 INFO L225 Difference]: With dead ends: 129131 [2019-01-12 18:07:40,467 INFO L226 Difference]: Without dead ends: 127492 [2019-01-12 18:07:40,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=571, Invalid=1685, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 18:07:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127492 states. [2019-01-12 18:08:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127492 to 103179. [2019-01-12 18:08:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103179 states. [2019-01-12 18:08:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103179 states to 103179 states and 125053 transitions. [2019-01-12 18:08:02,559 INFO L78 Accepts]: Start accepts. Automaton has 103179 states and 125053 transitions. Word has length 169 [2019-01-12 18:08:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 18:08:02,559 INFO L480 AbstractCegarLoop]: Abstraction has 103179 states and 125053 transitions. [2019-01-12 18:08:02,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 18:08:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 103179 states and 125053 transitions. [2019-01-12 18:08:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 18:08:02,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 18:08:02,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 18:08:02,616 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 18:08:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 18:08:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash -154290716, now seen corresponding path program 1 times [2019-01-12 18:08:02,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 18:08:02,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 18:08:02,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:08:02,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 18:08:02,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 18:08:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 18:08:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 18:08:02,814 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 18:08:03,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 06:08:03 BoogieIcfgContainer [2019-01-12 18:08:03,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 18:08:03,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 18:08:03,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 18:08:03,141 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 18:08:03,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:56:38" (3/4) ... [2019-01-12 18:08:03,146 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 18:08:03,458 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 18:08:03,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 18:08:03,459 INFO L168 Benchmark]: Toolchain (without parser) took 689046.84 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 947.3 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-12 18:08:03,461 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 18:08:03,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1013.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-01-12 18:08:03,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 162.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 18:08:03,462 INFO L168 Benchmark]: Boogie Preprocessor took 132.69 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-01-12 18:08:03,462 INFO L168 Benchmark]: RCFGBuilder took 2815.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.0 MB in the end (delta: 174.9 MB). Peak memory consumption was 174.9 MB. Max. memory is 11.5 GB. [2019-01-12 18:08:03,465 INFO L168 Benchmark]: TraceAbstraction took 684599.81 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 939.0 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-01-12 18:08:03,465 INFO L168 Benchmark]: Witness Printer took 317.69 ms. Allocated memory is still 6.5 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. [2019-01-12 18:08:03,469 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1013.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 162.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.69 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 2815.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.0 MB in the end (delta: 174.9 MB). Peak memory consumption was 174.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 684599.81 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 939.0 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 317.69 ms. Allocated memory is still 6.5 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1995]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L11] msg_t nomsg = (msg_t )-1; [L12] port_t p12 = 0; [L13] char p12_old = '\x0'; [L14] char p12_new = '\x0'; [L15] _Bool ep12 = 0; [L16] port_t p13 = 0; [L17] char p13_old = '\x0'; [L18] char p13_new = '\x0'; [L19] _Bool ep13 = 0; [L20] port_t p21 = 0; [L21] char p21_old = '\x0'; [L22] char p21_new = '\x0'; [L23] _Bool ep21 = 0; [L24] port_t p23 = 0; [L25] char p23_old = '\x0'; [L26] char p23_new = '\x0'; [L27] _Bool ep23 = 0; [L28] port_t p31 = 0; [L29] char p31_old = '\x0'; [L30] char p31_new = '\x0'; [L31] _Bool ep31 = 0; [L32] port_t p32 = 0; [L33] char p32_old = '\x0'; [L34] char p32_new = '\x0'; [L35] _Bool ep32 = 0; [L36] char id1 = '\x0'; [L37] char r1 = '\x0'; [L38] char st1 = '\x0'; [L39] char nl1 = '\x0'; [L40] char m1 = '\x0'; [L41] char max1 = '\x0'; [L42] _Bool mode1 = 0; [L43] char id2 = '\x0'; [L44] char r2 = '\x0'; [L45] char st2 = '\x0'; [L46] char nl2 = '\x0'; [L47] char m2 = '\x0'; [L48] char max2 = '\x0'; [L49] _Bool mode2 = 0; [L50] char id3 = '\x0'; [L51] char r3 = '\x0'; [L52] char st3 = '\x0'; [L53] char nl3 = '\x0'; [L54] char m3 = '\x0'; [L55] char max3 = '\x0'; [L56] _Bool mode3 = 0; [L60] void (*nodes[3])() = { &node1, &node2, &node3 }; [L64] int __return_1732; [L65] int __return_1860; [L66] int __return_1978; [L67] int __return_2099; [L68] int __return_2825; [L69] int __return_2791; [L70] int __tmp_2229_0; [L71] int __return_2337; [L72] int __return_2242; [L73] int __return_2712; [L74] int __return_2669; [L75] int __return_2572; [L76] int __return_2541; [L77] int __return_2483; [L78] int __return_2228; VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=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, 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] [L81] int main__c1; [L82] int main__i2; [L83] main__c1 = 0 [L84] ep12 = __VERIFIER_nondet_bool() [L85] ep13 = __VERIFIER_nondet_bool() [L86] ep21 = __VERIFIER_nondet_bool() [L87] ep23 = __VERIFIER_nondet_bool() [L88] ep31 = __VERIFIER_nondet_bool() [L89] ep32 = __VERIFIER_nondet_bool() [L90] id1 = __VERIFIER_nondet_char() [L91] r1 = __VERIFIER_nondet_char() [L92] st1 = __VERIFIER_nondet_char() [L93] nl1 = __VERIFIER_nondet_char() [L94] m1 = __VERIFIER_nondet_char() [L95] max1 = __VERIFIER_nondet_char() [L96] mode1 = __VERIFIER_nondet_bool() [L97] id2 = __VERIFIER_nondet_char() [L98] r2 = __VERIFIER_nondet_char() [L99] st2 = __VERIFIER_nondet_char() [L100] nl2 = __VERIFIER_nondet_char() [L101] m2 = __VERIFIER_nondet_char() [L102] max2 = __VERIFIER_nondet_char() [L103] mode2 = __VERIFIER_nondet_bool() [L104] id3 = __VERIFIER_nondet_char() [L105] r3 = __VERIFIER_nondet_char() [L106] st3 = __VERIFIER_nondet_char() [L107] nl3 = __VERIFIER_nondet_char() [L108] m3 = __VERIFIER_nondet_char() [L109] max3 = __VERIFIER_nondet_char() [L110] mode3 = __VERIFIER_nondet_bool() [L112] _Bool init__r121; [L113] _Bool init__r131; [L114] _Bool init__r211; [L115] _Bool init__r231; [L116] _Bool init__r311; [L117] _Bool init__r321; [L118] _Bool init__r122; [L119] int init__tmp; [L120] _Bool init__r132; [L121] int init__tmp___0; [L122] _Bool init__r212; [L123] int init__tmp___1; [L124] _Bool init__r232; [L125] int init__tmp___2; [L126] _Bool init__r312; [L127] int init__tmp___3; [L128] _Bool init__r322; [L129] int init__tmp___4; [L130] int init__tmp___5; [L131] init__r121 = ep12 [L132] init__r131 = ep13 [L133] init__r211 = ep21 [L134] init__r231 = ep23 [L135] init__r311 = ep31 [L136] init__r321 = ep32 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L137] COND FALSE !(!(init__r121 == 0)) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2949] COND TRUE !(init__r131 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2951] COND TRUE !(ep32 == 0) [L2953] init__tmp = 1 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L141] init__r122 = (_Bool)init__tmp VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L142] COND TRUE !(init__r131 == 0) [L144] init__tmp___0 = 1 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L146] init__r132 = (_Bool)init__tmp___0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] COND TRUE !(init__r211 == 0) [L149] init__tmp___1 = 1 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L151] init__r212 = (_Bool)init__tmp___1 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] COND FALSE !(!(init__r231 == 0)) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2880] COND TRUE !(init__r211 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2882] COND TRUE !(ep13 == 0) [L2884] init__tmp___2 = 1 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L156] init__r232 = (_Bool)init__tmp___2 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(init__r311 == 0)) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2857] COND TRUE !(init__r321 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2859] COND TRUE !(ep21 == 0) [L2861] init__tmp___3 = 1 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L161] init__r312 = (_Bool)init__tmp___3 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] COND TRUE !(init__r321 == 0) [L164] init__tmp___4 = 1 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L166] init__r322 = (_Bool)init__tmp___4 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L169] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L171] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id1) >= 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)id2) >= 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)id3) >= 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)r1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)r2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE ((int)r3) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE !(init__r122 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE !(init__r132 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE !(init__r212 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r232 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE !(init__r312 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE !(init__r322 == 0) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)st1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)st2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)st3) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)nl1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)nl2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)nl3) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)mode1) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)mode2) == 0 VAL [__return_1732=0, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)mode3) == 0 [L221] init__tmp___5 = 1 [L222] __return_1732 = init__tmp___5 [L223] main__i2 = __return_1732 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L224] COND TRUE main__i2 != 0 [L226] p12_old = nomsg [L227] p12_new = nomsg [L228] p13_old = nomsg [L229] p13_new = nomsg [L230] p21_old = nomsg [L231] p21_new = nomsg [L232] p23_old = nomsg [L233] p23_new = nomsg [L234] p31_old = nomsg [L235] p31_new = nomsg [L236] p32_old = nomsg [L237] p32_new = nomsg [L238] main__i2 = 0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L239] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L242] COND FALSE !(!(mode1 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L248] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L250] COND FALSE !(!(ep12 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] COND TRUE !(ep13 == 0) [L263] int node1____CPAchecker_TMP_1; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L264] COND TRUE max1 != nomsg VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND TRUE p13_new == nomsg [L268] node1____CPAchecker_TMP_1 = max1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L270] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] mode1 = 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L274] COND FALSE !(!(mode2 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L280] COND TRUE ((int)r2) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, 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 TRUE !(ep21 == 0) [L284] int node2____CPAchecker_TMP_0; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, 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] [L285] COND TRUE max2 != nomsg VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, 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] [L287] COND TRUE p21_new == nomsg [L289] node2____CPAchecker_TMP_0 = max2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, 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] [L291] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, 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] [L293] COND FALSE !(!(ep23 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, 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] [L304] mode2 = 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, 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] [L306] COND FALSE !(!(mode3 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, 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] [L312] COND TRUE ((int)r3) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, 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] COND FALSE !(!(ep31 == 0)) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, 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] [L325] COND TRUE !(ep32 == 0) [L327] int node3____CPAchecker_TMP_1; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L328] COND TRUE max3 != nomsg VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L330] COND TRUE p32_new == nomsg [L332] node3____CPAchecker_TMP_1 = max3 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, 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] [L334] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=127, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L336] mode3 = 1 [L337] p12_old = p12_new [L338] p12_new = nomsg [L339] p13_old = p13_new [L340] p13_new = nomsg [L341] p21_old = p21_new [L342] p21_new = nomsg [L343] p23_old = p23_new [L344] p23_new = nomsg [L345] p31_old = p31_new [L346] p31_new = nomsg [L347] p32_old = p32_new [L348] p32_new = nomsg [L350] int check__tmp; VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L351] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L367] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1732=1, __return_1860=0, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L377] COND TRUE ((int)r1) < 2 [L379] check__tmp = 1 [L380] __return_1860 = check__tmp [L381] main__c1 = __return_1860 [L383] _Bool __tmp_1; [L384] __tmp_1 = main__c1 [L385] _Bool assert__arg; [L386] assert__arg = __tmp_1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND FALSE !(assert__arg == 0) [L393] int main____CPAchecker_TMP_0 = main__i2; [L394] main__i2 = main__i2 + 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L395] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND TRUE !(mode1 == 0) [L400] r1 = (char)(((int)r1) + 1) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND TRUE !(ep21 == 0) [L403] m1 = p21_old [L404] p21_old = nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND FALSE !(!(ep31 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L417] COND FALSE !(((int)r1) == 2) [L423] mode1 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE !(mode2 == 0) [L427] r2 = (char)(((int)r2) + 1) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L428] COND FALSE !(!(ep12 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=0, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE !(ep32 == 0) [L438] m2 = p32_old [L439] p32_old = nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=0, max1=126, max2=0, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int)m2) > ((int)max2) [L442] max2 = m2 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=0, max1=126, max2=127, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L444] COND FALSE !(((int)r2) == 2) [L450] mode2 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=0, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE !(mode3 == 0) [L454] r3 = (char)(((int)r3) + 1) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=0, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE !(ep13 == 0) [L457] m3 = p13_old [L458] p13_old = nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L463] COND FALSE !(!(ep23 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND FALSE !(((int)r3) == 2) [L477] mode3 = 0 [L478] p12_old = p12_new [L479] p12_new = nomsg [L480] p13_old = p13_new [L481] p13_new = nomsg [L482] p21_old = p21_new [L483] p21_new = nomsg [L484] p23_old = p23_new [L485] p23_new = nomsg [L486] p31_old = p31_new [L487] p31_new = nomsg [L488] p32_old = p32_new [L489] p32_new = nomsg [L491] int check__tmp; VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L500] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L506] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L516] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=0, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int)r1) < 2 [L520] check__tmp = 1 [L521] __return_1978 = check__tmp [L522] main__c1 = __return_1978 [L524] _Bool __tmp_2; [L525] __tmp_2 = main__c1 [L526] _Bool assert__arg; [L527] assert__arg = __tmp_2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L528] COND FALSE !(assert__arg == 0) [L534] int main____CPAchecker_TMP_0 = main__i2; [L535] main__i2 = main__i2 + 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L536] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L539] COND FALSE !(!(mode1 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L547] COND FALSE !(!(ep12 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L558] COND TRUE !(ep13 == 0) [L560] int node1____CPAchecker_TMP_1; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L561] COND TRUE max1 != nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L563] COND TRUE p13_new == nomsg [L565] node1____CPAchecker_TMP_1 = max1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L567] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] mode1 = 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L571] COND FALSE !(!(mode2 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L577] COND TRUE ((int)r2) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] COND TRUE !(ep21 == 0) [L581] int node2____CPAchecker_TMP_0; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L582] COND TRUE max2 != nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L584] COND TRUE p21_new == nomsg [L586] node2____CPAchecker_TMP_0 = max2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L588] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L590] COND FALSE !(!(ep23 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L601] mode2 = 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L603] COND FALSE !(!(mode3 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L609] COND TRUE ((int)r3) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] COND FALSE !(!(ep31 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L622] COND TRUE !(ep32 == 0) [L624] int node3____CPAchecker_TMP_1; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L625] COND TRUE max3 != nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L627] COND TRUE p32_new == nomsg [L629] node3____CPAchecker_TMP_1 = max3 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L631] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=126, p13_old=-1, p21=0, p21_new=127, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=127, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L633] mode3 = 1 [L634] p12_old = p12_new [L635] p12_new = nomsg [L636] p13_old = p13_new [L637] p13_new = nomsg [L638] p21_old = p21_new [L639] p21_new = nomsg [L640] p23_old = p23_new [L641] p23_new = nomsg [L642] p31_old = p31_new [L643] p31_new = nomsg [L644] p32_old = p32_new [L645] p32_new = nomsg [L647] int check__tmp; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L648] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L650] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L652] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L654] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L656] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L662] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L664] COND TRUE ((int)r1) < 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L666] COND FALSE !(((int)r1) >= 2) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L672] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=0, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L674] COND TRUE ((int)r1) < 2 [L676] check__tmp = 1 [L677] __return_2099 = check__tmp [L678] main__c1 = __return_2099 [L680] _Bool __tmp_3; [L681] __tmp_3 = main__c1 [L682] _Bool assert__arg; [L683] assert__arg = __tmp_3 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L684] COND FALSE !(assert__arg == 0) [L690] int main____CPAchecker_TMP_0 = main__i2; [L691] main__i2 = main__i2 + 1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L692] COND TRUE main__i2 < 6 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L695] COND TRUE !(mode1 == 0) [L697] r1 = (char)(((int)r1) + 1) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=0, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=127, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L698] COND TRUE !(ep21 == 0) [L700] m1 = p21_old [L701] p21_old = nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=126, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L702] COND TRUE ((int)m1) > ((int)max1) [L704] max1 = m1 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L706] COND FALSE !(!(ep31 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L714] COND TRUE ((int)r1) == 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L716] COND FALSE !(((int)max1) == ((int)id1)) [L1763] st1 = 1 [L1764] mode1 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=2, r2=1, r3=1, st1=1, st2=0, st3=0] [L1766] COND TRUE !(mode2 == 0) [L1768] r2 = (char)(((int)r2) + 1) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1769] COND FALSE !(!(ep12 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, 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=127, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1777] COND TRUE !(ep32 == 0) [L1779] m2 = p32_old [L1780] p32_old = nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1781] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1785] COND TRUE ((int)r2) == 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1787] COND FALSE !(((int)max2) == ((int)id2)) [L1937] nl2 = 1 [L1938] mode2 = 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=1, st2=0, st3=0] [L1940] COND TRUE !(mode3 == 0) [L1942] r3 = (char)(((int)r3) + 1) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=0] [L1943] COND TRUE !(ep13 == 0) [L1945] m3 = p13_old [L1946] p13_old = nomsg VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=0] [L1947] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=0] [L1951] COND FALSE !(!(ep23 == 0)) VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=0] [L1959] COND TRUE ((int)r3) == 2 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=0] [L1961] COND TRUE ((int)max3) == ((int)id3) [L1963] st3 = 1 [L1964] mode3 = 0 [L1965] p12_old = p12_new [L1966] p12_new = nomsg [L1967] p13_old = p13_new [L1968] p13_new = nomsg [L1969] p21_old = p21_new [L1970] p21_new = nomsg [L1971] p23_old = p23_new [L1972] p23_new = nomsg [L1973] p31_old = p31_new [L1974] p31_new = nomsg [L1975] p32_old = p32_new [L1976] p32_new = nomsg [L1978] int check__tmp; VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L1979] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1985] check__tmp = 0 [L1986] __return_2483 = check__tmp [L1987] main__c1 = __return_2483 [L1989] _Bool __tmp_8; [L1990] __tmp_8 = main__c1 [L1991] _Bool assert__arg; [L1992] assert__arg = __tmp_8 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L1993] COND TRUE assert__arg == 0 VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L1995] __VERIFIER_error() VAL [__return_1732=1, __return_1860=1, __return_1978=1, __return_2099=1, __return_2228=0, __return_2242=0, __return_2337=0, __return_2483=0, __return_2541=0, __return_2572=0, __return_2669=0, __return_2712=0, __return_2791=0, __return_2825=0, __return_main=0, __tmp_2229_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=126, id2=0, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 377 locations, 5 error locations. UNSAFE Result, 684.5s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 396.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28324 SDtfs, 71809 SDslu, 115414 SDs, 0 SdLazy, 30442 SolverSat, 2279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 76 SyntacticMatches, 13 SemanticMatches, 547 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3428 ImplicationChecksByTransitivity, 33.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103179occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 266.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 505502 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 6357 NumberOfCodeBlocks, 6357 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 6149 ConstructedInterpolants, 0 QuantifiedInterpolants, 6224581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...