java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:03:27,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:03:27,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:03:27,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:03:27,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:03:27,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:03:27,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:03:27,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:03:27,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:03:27,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:03:27,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:03:27,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:03:27,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:03:27,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:03:27,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:03:27,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:03:27,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:03:27,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:03:27,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:03:27,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:03:27,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:03:27,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:03:27,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:03:27,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:03:27,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:03:27,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:03:27,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:03:27,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:03:27,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:03:27,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:03:27,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:03:27,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:03:27,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:03:27,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:03:27,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:03:27,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:03:27,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:03:27,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:03:27,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:03:27,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:03:27,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:03:27,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:03:27,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:03:27,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:03:27,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:03:27,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:03:27,568 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:03:27,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:03:27,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:03:27,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:03:27,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:03:27,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:03:27,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:03:27,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:03:27,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:03:27,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:03:27,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:03:27,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:03:27,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:03:27,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:03:27,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:03:27,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:03:27,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:03:27,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:03:27,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:03:27,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:03:27,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:03:27,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:03:27,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:03:27,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:03:27,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:03:27,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:03:27,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:03:27,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:03:27,618 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:03:27,619 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:03:27,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:03:27,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913330f45/127facb79df24f2b8e1931706453b4e3/FLAGe0c6be94c [2019-09-08 10:03:28,412 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:03:28,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:03:28,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913330f45/127facb79df24f2b8e1931706453b4e3/FLAGe0c6be94c [2019-09-08 10:03:28,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913330f45/127facb79df24f2b8e1931706453b4e3 [2019-09-08 10:03:28,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:03:28,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:03:28,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:03:28,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:03:28,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:03:28,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:03:28" (1/1) ... [2019-09-08 10:03:28,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f340cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:28, skipping insertion in model container [2019-09-08 10:03:28,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:03:28" (1/1) ... [2019-09-08 10:03:28,528 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:03:28,708 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:03:29,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:03:29,990 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:03:31,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:03:31,394 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:03:31,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31 WrapperNode [2019-09-08 10:03:31,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:03:31,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:03:31,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:03:31,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:03:31,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (1/1) ... [2019-09-08 10:03:31,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (1/1) ... [2019-09-08 10:03:31,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (1/1) ... [2019-09-08 10:03:31,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (1/1) ... [2019-09-08 10:03:31,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (1/1) ... [2019-09-08 10:03:31,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (1/1) ... [2019-09-08 10:03:31,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (1/1) ... [2019-09-08 10:03:31,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:03:31,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:03:31,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:03:31,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:03:31,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (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-09-08 10:03:31,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:03:31,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:03:31,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:03:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:03:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:03:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:03:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:03:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:03:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:03:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:03:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:03:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:03:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:03:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:03:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:03:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:03:31,640 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:03:31,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:03:31,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:03:31,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:03:34,611 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:03:34,611 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:03:34,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:03:34 BoogieIcfgContainer [2019-09-08 10:03:34,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:03:34,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:03:34,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:03:34,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:03:34,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:03:28" (1/3) ... [2019-09-08 10:03:34,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f30acf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:03:34, skipping insertion in model container [2019-09-08 10:03:34,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:31" (2/3) ... [2019-09-08 10:03:34,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f30acf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:03:34, skipping insertion in model container [2019-09-08 10:03:34,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:03:34" (3/3) ... [2019-09-08 10:03:34,626 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:03:34,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:03:34,643 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 10:03:34,660 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 10:03:34,699 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:03:34,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:03:34,700 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:03:34,700 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:03:34,700 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:03:34,700 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:03:34,701 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:03:34,701 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:03:34,701 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:03:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states. [2019-09-08 10:03:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 10:03:34,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:34,766 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:34,769 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1047538598, now seen corresponding path program 1 times [2019-09-08 10:03:34,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:34,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:34,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:34,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:34,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:35,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:35,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:35,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:35,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:35,793 INFO L87 Difference]: Start difference. First operand 934 states. Second operand 3 states. [2019-09-08 10:03:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:36,130 INFO L93 Difference]: Finished difference Result 1615 states and 2885 transitions. [2019-09-08 10:03:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:36,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 10:03:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:36,167 INFO L225 Difference]: With dead ends: 1615 [2019-09-08 10:03:36,168 INFO L226 Difference]: Without dead ends: 1335 [2019-09-08 10:03:36,179 INFO L628 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-09-08 10:03:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-08 10:03:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-09-08 10:03:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-08 10:03:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2029 transitions. [2019-09-08 10:03:36,342 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2029 transitions. Word has length 308 [2019-09-08 10:03:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:36,344 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2029 transitions. [2019-09-08 10:03:36,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2029 transitions. [2019-09-08 10:03:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 10:03:36,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:36,355 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:36,356 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1368896459, now seen corresponding path program 1 times [2019-09-08 10:03:36,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:36,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:36,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:36,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:36,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:37,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:37,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:37,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:37,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:37,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:37,334 INFO L87 Difference]: Start difference. First operand 1333 states and 2029 transitions. Second operand 4 states. [2019-09-08 10:03:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:37,587 INFO L93 Difference]: Finished difference Result 3935 states and 5986 transitions. [2019-09-08 10:03:37,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:37,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 10:03:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:37,602 INFO L225 Difference]: With dead ends: 3935 [2019-09-08 10:03:37,603 INFO L226 Difference]: Without dead ends: 2617 [2019-09-08 10:03:37,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-09-08 10:03:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2521. [2019-09-08 10:03:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-09-08 10:03:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3840 transitions. [2019-09-08 10:03:37,717 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3840 transitions. Word has length 308 [2019-09-08 10:03:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:37,718 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 3840 transitions. [2019-09-08 10:03:37,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3840 transitions. [2019-09-08 10:03:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 10:03:37,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:37,727 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:37,728 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:37,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1611556797, now seen corresponding path program 1 times [2019-09-08 10:03:37,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:37,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:37,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:37,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:37,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:38,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:38,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:38,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:38,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:38,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:38,062 INFO L87 Difference]: Start difference. First operand 2521 states and 3840 transitions. Second operand 3 states. [2019-09-08 10:03:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:38,339 INFO L93 Difference]: Finished difference Result 7348 states and 11156 transitions. [2019-09-08 10:03:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:38,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 10:03:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:38,371 INFO L225 Difference]: With dead ends: 7348 [2019-09-08 10:03:38,372 INFO L226 Difference]: Without dead ends: 4956 [2019-09-08 10:03:38,389 INFO L628 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-09-08 10:03:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-09-08 10:03:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4860. [2019-09-08 10:03:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4860 states. [2019-09-08 10:03:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 7389 transitions. [2019-09-08 10:03:38,643 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 7389 transitions. Word has length 310 [2019-09-08 10:03:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:38,645 INFO L475 AbstractCegarLoop]: Abstraction has 4860 states and 7389 transitions. [2019-09-08 10:03:38,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 7389 transitions. [2019-09-08 10:03:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 10:03:38,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:38,659 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:38,659 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 158227778, now seen corresponding path program 1 times [2019-09-08 10:03:38,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:38,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:38,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:38,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:38,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:38,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:38,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:38,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:38,851 INFO L87 Difference]: Start difference. First operand 4860 states and 7389 transitions. Second operand 3 states. [2019-09-08 10:03:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:39,341 INFO L93 Difference]: Finished difference Result 14505 states and 22043 transitions. [2019-09-08 10:03:39,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:39,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 10:03:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:39,390 INFO L225 Difference]: With dead ends: 14505 [2019-09-08 10:03:39,390 INFO L226 Difference]: Without dead ends: 9687 [2019-09-08 10:03:39,406 INFO L628 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-09-08 10:03:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2019-09-08 10:03:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 4879. [2019-09-08 10:03:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2019-09-08 10:03:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 7417 transitions. [2019-09-08 10:03:39,733 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 7417 transitions. Word has length 310 [2019-09-08 10:03:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:39,733 INFO L475 AbstractCegarLoop]: Abstraction has 4879 states and 7417 transitions. [2019-09-08 10:03:39,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 7417 transitions. [2019-09-08 10:03:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 10:03:39,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:39,746 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:39,747 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2041948487, now seen corresponding path program 1 times [2019-09-08 10:03:39,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:39,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:39,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:39,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:39,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:39,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:39,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:39,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:39,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:39,900 INFO L87 Difference]: Start difference. First operand 4879 states and 7417 transitions. Second operand 3 states. [2019-09-08 10:03:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:40,343 INFO L93 Difference]: Finished difference Result 14524 states and 22064 transitions. [2019-09-08 10:03:40,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:40,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-08 10:03:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:40,389 INFO L225 Difference]: With dead ends: 14524 [2019-09-08 10:03:40,389 INFO L226 Difference]: Without dead ends: 9705 [2019-09-08 10:03:40,402 INFO L628 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-09-08 10:03:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-09-08 10:03:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 4897. [2019-09-08 10:03:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2019-09-08 10:03:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 7438 transitions. [2019-09-08 10:03:40,698 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 7438 transitions. Word has length 311 [2019-09-08 10:03:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:40,699 INFO L475 AbstractCegarLoop]: Abstraction has 4897 states and 7438 transitions. [2019-09-08 10:03:40,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 7438 transitions. [2019-09-08 10:03:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 10:03:40,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:40,712 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:40,712 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:40,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1063211659, now seen corresponding path program 1 times [2019-09-08 10:03:40,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:40,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:40,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:41,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:41,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:41,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:41,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:41,062 INFO L87 Difference]: Start difference. First operand 4897 states and 7438 transitions. Second operand 4 states. [2019-09-08 10:03:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:41,539 INFO L93 Difference]: Finished difference Result 14200 states and 21469 transitions. [2019-09-08 10:03:41,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:41,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 10:03:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:41,561 INFO L225 Difference]: With dead ends: 14200 [2019-09-08 10:03:41,562 INFO L226 Difference]: Without dead ends: 9632 [2019-09-08 10:03:41,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2019-09-08 10:03:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 5104. [2019-09-08 10:03:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-09-08 10:03:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 7791 transitions. [2019-09-08 10:03:41,878 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 7791 transitions. Word has length 312 [2019-09-08 10:03:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:41,879 INFO L475 AbstractCegarLoop]: Abstraction has 5104 states and 7791 transitions. [2019-09-08 10:03:41,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 7791 transitions. [2019-09-08 10:03:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 10:03:41,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:41,892 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:41,893 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:41,894 INFO L82 PathProgramCache]: Analyzing trace with hash 76522648, now seen corresponding path program 1 times [2019-09-08 10:03:41,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:41,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:41,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:42,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:42,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:42,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:42,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:42,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:42,149 INFO L87 Difference]: Start difference. First operand 5104 states and 7791 transitions. Second operand 3 states. [2019-09-08 10:03:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:42,782 INFO L93 Difference]: Finished difference Result 14451 states and 21907 transitions. [2019-09-08 10:03:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:42,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 10:03:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:42,811 INFO L225 Difference]: With dead ends: 14451 [2019-09-08 10:03:42,811 INFO L226 Difference]: Without dead ends: 9767 [2019-09-08 10:03:42,824 INFO L628 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-09-08 10:03:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-09-08 10:03:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9671. [2019-09-08 10:03:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-09-08 10:03:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 14646 transitions. [2019-09-08 10:03:43,337 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 14646 transitions. Word has length 312 [2019-09-08 10:03:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:43,338 INFO L475 AbstractCegarLoop]: Abstraction has 9671 states and 14646 transitions. [2019-09-08 10:03:43,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 14646 transitions. [2019-09-08 10:03:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 10:03:43,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:43,363 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:43,364 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 344350536, now seen corresponding path program 1 times [2019-09-08 10:03:43,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:43,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:43,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:43,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:43,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:43,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:43,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:43,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:43,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:43,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:43,514 INFO L87 Difference]: Start difference. First operand 9671 states and 14646 transitions. Second operand 3 states. [2019-09-08 10:03:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:44,384 INFO L93 Difference]: Finished difference Result 27443 states and 41219 transitions. [2019-09-08 10:03:44,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:44,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 10:03:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:44,427 INFO L225 Difference]: With dead ends: 27443 [2019-09-08 10:03:44,427 INFO L226 Difference]: Without dead ends: 18575 [2019-09-08 10:03:44,450 INFO L628 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-09-08 10:03:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18575 states. [2019-09-08 10:03:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18575 to 9775. [2019-09-08 10:03:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9775 states. [2019-09-08 10:03:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 14789 transitions. [2019-09-08 10:03:45,128 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 14789 transitions. Word has length 314 [2019-09-08 10:03:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:45,128 INFO L475 AbstractCegarLoop]: Abstraction has 9775 states and 14789 transitions. [2019-09-08 10:03:45,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 14789 transitions. [2019-09-08 10:03:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 10:03:45,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:45,154 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:45,155 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1359161051, now seen corresponding path program 1 times [2019-09-08 10:03:45,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:45,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:45,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:45,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:45,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:45,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:45,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:45,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:45,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:45,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:45,484 INFO L87 Difference]: Start difference. First operand 9775 states and 14789 transitions. Second operand 3 states. [2019-09-08 10:03:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:46,248 INFO L93 Difference]: Finished difference Result 27575 states and 41385 transitions. [2019-09-08 10:03:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:46,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-08 10:03:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:46,293 INFO L225 Difference]: With dead ends: 27575 [2019-09-08 10:03:46,293 INFO L226 Difference]: Without dead ends: 18700 [2019-09-08 10:03:46,318 INFO L628 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-09-08 10:03:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18700 states. [2019-09-08 10:03:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18700 to 9900. [2019-09-08 10:03:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9900 states. [2019-09-08 10:03:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 14935 transitions. [2019-09-08 10:03:47,681 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 14935 transitions. Word has length 315 [2019-09-08 10:03:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:47,681 INFO L475 AbstractCegarLoop]: Abstraction has 9900 states and 14935 transitions. [2019-09-08 10:03:47,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 14935 transitions. [2019-09-08 10:03:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 10:03:47,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:47,704 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:47,705 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1350075397, now seen corresponding path program 1 times [2019-09-08 10:03:47,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:47,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:47,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:47,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:47,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:48,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:48,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:48,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:48,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:48,074 INFO L87 Difference]: Start difference. First operand 9900 states and 14935 transitions. Second operand 4 states. [2019-09-08 10:03:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:48,541 INFO L93 Difference]: Finished difference Result 17765 states and 26664 transitions. [2019-09-08 10:03:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:48,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-08 10:03:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:48,562 INFO L225 Difference]: With dead ends: 17765 [2019-09-08 10:03:48,562 INFO L226 Difference]: Without dead ends: 8728 [2019-09-08 10:03:48,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2019-09-08 10:03:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 8708. [2019-09-08 10:03:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8708 states. [2019-09-08 10:03:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8708 states to 8708 states and 13146 transitions. [2019-09-08 10:03:49,037 INFO L78 Accepts]: Start accepts. Automaton has 8708 states and 13146 transitions. Word has length 316 [2019-09-08 10:03:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:49,037 INFO L475 AbstractCegarLoop]: Abstraction has 8708 states and 13146 transitions. [2019-09-08 10:03:49,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8708 states and 13146 transitions. [2019-09-08 10:03:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 10:03:49,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:49,058 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:49,059 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1210298449, now seen corresponding path program 1 times [2019-09-08 10:03:49,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:49,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:49,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:49,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:03:49,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:03:49,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:03:49,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:03:49,652 INFO L87 Difference]: Start difference. First operand 8708 states and 13146 transitions. Second operand 8 states. [2019-09-08 10:03:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:50,565 INFO L93 Difference]: Finished difference Result 16143 states and 24657 transitions. [2019-09-08 10:03:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:50,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 320 [2019-09-08 10:03:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:50,597 INFO L225 Difference]: With dead ends: 16143 [2019-09-08 10:03:50,598 INFO L226 Difference]: Without dead ends: 14070 [2019-09-08 10:03:50,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:03:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14070 states. [2019-09-08 10:03:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14070 to 14068. [2019-09-08 10:03:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14068 states. [2019-09-08 10:03:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14068 states to 14068 states and 21202 transitions. [2019-09-08 10:03:51,587 INFO L78 Accepts]: Start accepts. Automaton has 14068 states and 21202 transitions. Word has length 320 [2019-09-08 10:03:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:51,587 INFO L475 AbstractCegarLoop]: Abstraction has 14068 states and 21202 transitions. [2019-09-08 10:03:51,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:03:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14068 states and 21202 transitions. [2019-09-08 10:03:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 10:03:51,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:51,606 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:51,607 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash -26379179, now seen corresponding path program 1 times [2019-09-08 10:03:51,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:51,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:51,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:51,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:51,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:51,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:51,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:51,869 INFO L87 Difference]: Start difference. First operand 14068 states and 21202 transitions. Second operand 3 states. [2019-09-08 10:03:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:53,147 INFO L93 Difference]: Finished difference Result 28921 states and 44165 transitions. [2019-09-08 10:03:53,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:53,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 10:03:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:53,178 INFO L225 Difference]: With dead ends: 28921 [2019-09-08 10:03:53,178 INFO L226 Difference]: Without dead ends: 24810 [2019-09-08 10:03:53,190 INFO L628 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-09-08 10:03:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24810 states. [2019-09-08 10:03:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24810 to 24784. [2019-09-08 10:03:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24784 states. [2019-09-08 10:03:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24784 states to 24784 states and 37346 transitions. [2019-09-08 10:03:54,259 INFO L78 Accepts]: Start accepts. Automaton has 24784 states and 37346 transitions. Word has length 320 [2019-09-08 10:03:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:54,259 INFO L475 AbstractCegarLoop]: Abstraction has 24784 states and 37346 transitions. [2019-09-08 10:03:54,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 24784 states and 37346 transitions. [2019-09-08 10:03:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 10:03:54,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:54,279 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:03:54,279 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash 599474300, now seen corresponding path program 1 times [2019-09-08 10:03:54,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:54,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:55,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:55,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:03:55,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:03:55,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:03:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:03:55,552 INFO L87 Difference]: Start difference. First operand 24784 states and 37346 transitions. Second operand 17 states. [2019-09-08 10:04:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:01,264 INFO L93 Difference]: Finished difference Result 43442 states and 66280 transitions. [2019-09-08 10:04:01,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:04:01,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 320 [2019-09-08 10:04:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:01,315 INFO L225 Difference]: With dead ends: 43442 [2019-09-08 10:04:01,315 INFO L226 Difference]: Without dead ends: 40824 [2019-09-08 10:04:01,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=368, Invalid=1038, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:04:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40824 states. [2019-09-08 10:04:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40824 to 28368. [2019-09-08 10:04:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28368 states. [2019-09-08 10:04:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28368 states to 28368 states and 42434 transitions. [2019-09-08 10:04:02,917 INFO L78 Accepts]: Start accepts. Automaton has 28368 states and 42434 transitions. Word has length 320 [2019-09-08 10:04:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:02,917 INFO L475 AbstractCegarLoop]: Abstraction has 28368 states and 42434 transitions. [2019-09-08 10:04:02,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:04:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28368 states and 42434 transitions. [2019-09-08 10:04:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 10:04:02,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:02,937 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:04:02,938 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1649933196, now seen corresponding path program 1 times [2019-09-08 10:04:02,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:02,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:02,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:04:03,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:03,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:04:03,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:04:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:04:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:04:03,569 INFO L87 Difference]: Start difference. First operand 28368 states and 42434 transitions. Second operand 4 states. [2019-09-08 10:04:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:06,847 INFO L93 Difference]: Finished difference Result 83638 states and 124919 transitions. [2019-09-08 10:04:06,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:04:06,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 10:04:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:06,903 INFO L225 Difference]: With dead ends: 83638 [2019-09-08 10:04:06,903 INFO L226 Difference]: Without dead ends: 55342 [2019-09-08 10:04:06,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:04:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55342 states. [2019-09-08 10:04:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55342 to 55240. [2019-09-08 10:04:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55240 states. [2019-09-08 10:04:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55240 states to 55240 states and 82018 transitions. [2019-09-08 10:04:10,895 INFO L78 Accepts]: Start accepts. Automaton has 55240 states and 82018 transitions. Word has length 320 [2019-09-08 10:04:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:10,895 INFO L475 AbstractCegarLoop]: Abstraction has 55240 states and 82018 transitions. [2019-09-08 10:04:10,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:04:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 55240 states and 82018 transitions. [2019-09-08 10:04:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 10:04:10,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:10,939 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:04:10,940 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:10,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash 139592251, now seen corresponding path program 1 times [2019-09-08 10:04:10,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:10,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:10,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:10,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:10,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:04:11,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:11,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:11,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:11,143 INFO L87 Difference]: Start difference. First operand 55240 states and 82018 transitions. Second operand 3 states. [2019-09-08 10:04:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:17,914 INFO L93 Difference]: Finished difference Result 161762 states and 239506 transitions. [2019-09-08 10:04:17,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:17,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 10:04:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:18,021 INFO L225 Difference]: With dead ends: 161762 [2019-09-08 10:04:18,021 INFO L226 Difference]: Without dead ends: 107771 [2019-09-08 10:04:18,077 INFO L628 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-09-08 10:04:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107771 states. [2019-09-08 10:04:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107771 to 107673. [2019-09-08 10:04:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107673 states. [2019-09-08 10:04:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107673 states to 107673 states and 158596 transitions. [2019-09-08 10:04:23,906 INFO L78 Accepts]: Start accepts. Automaton has 107673 states and 158596 transitions. Word has length 322 [2019-09-08 10:04:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:23,907 INFO L475 AbstractCegarLoop]: Abstraction has 107673 states and 158596 transitions. [2019-09-08 10:04:23,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 107673 states and 158596 transitions. [2019-09-08 10:04:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 10:04:23,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:23,975 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:04:23,975 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -447273514, now seen corresponding path program 1 times [2019-09-08 10:04:23,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:23,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:04:24,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:24,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:24,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:24,228 INFO L87 Difference]: Start difference. First operand 107673 states and 158596 transitions. Second operand 3 states. [2019-09-08 10:04:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:35,750 INFO L93 Difference]: Finished difference Result 304021 states and 446546 transitions. [2019-09-08 10:04:35,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:35,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 10:04:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:35,980 INFO L225 Difference]: With dead ends: 304021 [2019-09-08 10:04:35,980 INFO L226 Difference]: Without dead ends: 197695 [2019-09-08 10:04:36,077 INFO L628 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-09-08 10:04:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197695 states. [2019-09-08 10:04:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197695 to 197601. [2019-09-08 10:04:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197601 states. [2019-09-08 10:04:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197601 states to 197601 states and 288289 transitions. [2019-09-08 10:04:50,543 INFO L78 Accepts]: Start accepts. Automaton has 197601 states and 288289 transitions. Word has length 324 [2019-09-08 10:04:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:50,544 INFO L475 AbstractCegarLoop]: Abstraction has 197601 states and 288289 transitions. [2019-09-08 10:04:50,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:04:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 197601 states and 288289 transitions. [2019-09-08 10:04:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 10:04:50,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:50,685 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:04:50,685 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash 791445107, now seen corresponding path program 1 times [2019-09-08 10:04:50,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:50,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:04:53,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:53,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:04:53,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:04:53,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:04:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:04:53,845 INFO L87 Difference]: Start difference. First operand 197601 states and 288289 transitions. Second operand 4 states. [2019-09-08 10:05:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:13,641 INFO L93 Difference]: Finished difference Result 542759 states and 790381 transitions. [2019-09-08 10:05:13,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:05:13,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 10:05:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:14,027 INFO L225 Difference]: With dead ends: 542759 [2019-09-08 10:05:14,027 INFO L226 Difference]: Without dead ends: 348450 [2019-09-08 10:05:14,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:05:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348450 states. [2019-09-08 10:05:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348450 to 193666. [2019-09-08 10:05:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193666 states. [2019-09-08 10:05:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193666 states to 193666 states and 282532 transitions. [2019-09-08 10:05:31,893 INFO L78 Accepts]: Start accepts. Automaton has 193666 states and 282532 transitions. Word has length 324 [2019-09-08 10:05:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:31,893 INFO L475 AbstractCegarLoop]: Abstraction has 193666 states and 282532 transitions. [2019-09-08 10:05:31,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:05:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 193666 states and 282532 transitions. [2019-09-08 10:05:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 10:05:32,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:32,041 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:05:32,042 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash -489171085, now seen corresponding path program 1 times [2019-09-08 10:05:32,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:32,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:32,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:05:32,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:32,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:32,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:32,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:32,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:32,211 INFO L87 Difference]: Start difference. First operand 193666 states and 282532 transitions. Second operand 3 states. [2019-09-08 10:05:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:57,188 INFO L93 Difference]: Finished difference Result 528364 states and 769380 transitions. [2019-09-08 10:05:57,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:05:57,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 10:05:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:57,554 INFO L225 Difference]: With dead ends: 528364 [2019-09-08 10:05:57,554 INFO L226 Difference]: Without dead ends: 345501 [2019-09-08 10:05:57,699 INFO L628 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-09-08 10:05:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345501 states. [2019-09-08 10:06:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345501 to 194147. [2019-09-08 10:06:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194147 states. [2019-09-08 10:06:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194147 states to 194147 states and 283130 transitions. [2019-09-08 10:06:17,090 INFO L78 Accepts]: Start accepts. Automaton has 194147 states and 283130 transitions. Word has length 327 [2019-09-08 10:06:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:17,090 INFO L475 AbstractCegarLoop]: Abstraction has 194147 states and 283130 transitions. [2019-09-08 10:06:17,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:06:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 194147 states and 283130 transitions. [2019-09-08 10:06:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 10:06:17,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:17,220 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:06:17,221 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1966781366, now seen corresponding path program 1 times [2019-09-08 10:06:17,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:17,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:17,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:06:17,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:17,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:06:17,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:06:17,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:06:17,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:06:17,533 INFO L87 Difference]: Start difference. First operand 194147 states and 283130 transitions. Second operand 4 states. [2019-09-08 10:06:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:32,486 INFO L93 Difference]: Finished difference Result 372804 states and 543171 transitions. [2019-09-08 10:06:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:06:32,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 10:06:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:32,663 INFO L225 Difference]: With dead ends: 372804 [2019-09-08 10:06:32,663 INFO L226 Difference]: Without dead ends: 183969 [2019-09-08 10:06:32,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:06:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183969 states. [2019-09-08 10:06:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183969 to 183642. [2019-09-08 10:06:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183642 states. [2019-09-08 10:06:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183642 states to 183642 states and 267980 transitions. [2019-09-08 10:06:46,531 INFO L78 Accepts]: Start accepts. Automaton has 183642 states and 267980 transitions. Word has length 328 [2019-09-08 10:06:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:46,531 INFO L475 AbstractCegarLoop]: Abstraction has 183642 states and 267980 transitions. [2019-09-08 10:06:46,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:06:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 183642 states and 267980 transitions. [2019-09-08 10:06:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 10:06:46,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:46,658 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:06:46,659 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:46,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:46,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1151178778, now seen corresponding path program 1 times [2019-09-08 10:06:46,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:46,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:46,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:06:46,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:46,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:06:46,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:06:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:06:46,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:46,905 INFO L87 Difference]: Start difference. First operand 183642 states and 267980 transitions. Second operand 3 states. [2019-09-08 10:07:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:11,825 INFO L93 Difference]: Finished difference Result 493311 states and 720376 transitions. [2019-09-08 10:07:11,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:11,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 10:07:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:12,187 INFO L225 Difference]: With dead ends: 493311 [2019-09-08 10:07:12,187 INFO L226 Difference]: Without dead ends: 324795 [2019-09-08 10:07:12,310 INFO L628 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-09-08 10:07:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324795 states. [2019-09-08 10:07:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324795 to 324633. [2019-09-08 10:07:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324633 states. [2019-09-08 10:07:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324633 states to 324633 states and 471420 transitions. [2019-09-08 10:07:41,159 INFO L78 Accepts]: Start accepts. Automaton has 324633 states and 471420 transitions. Word has length 332 [2019-09-08 10:07:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:41,160 INFO L475 AbstractCegarLoop]: Abstraction has 324633 states and 471420 transitions. [2019-09-08 10:07:41,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 324633 states and 471420 transitions. [2019-09-08 10:07:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 10:07:41,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:41,411 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:07:41,411 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash -100909781, now seen corresponding path program 1 times [2019-09-08 10:07:41,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:41,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:41,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:41,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:41,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:41,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:41,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:41,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:41,718 INFO L87 Difference]: Start difference. First operand 324633 states and 471420 transitions. Second operand 4 states. [2019-09-08 10:08:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:06,190 INFO L93 Difference]: Finished difference Result 395567 states and 587078 transitions. [2019-09-08 10:08:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:08:06,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 10:08:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:06,912 INFO L225 Difference]: With dead ends: 395567 [2019-09-08 10:08:06,912 INFO L226 Difference]: Without dead ends: 301747 [2019-09-08 10:08:06,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:08:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301747 states. [2019-09-08 10:08:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301747 to 301745. [2019-09-08 10:08:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301745 states. [2019-09-08 10:08:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301745 states to 301745 states and 433307 transitions. [2019-09-08 10:08:35,206 INFO L78 Accepts]: Start accepts. Automaton has 301745 states and 433307 transitions. Word has length 332 [2019-09-08 10:08:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:35,207 INFO L475 AbstractCegarLoop]: Abstraction has 301745 states and 433307 transitions. [2019-09-08 10:08:35,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:08:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 301745 states and 433307 transitions. [2019-09-08 10:08:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 10:08:35,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:35,463 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:08:35,463 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1632277617, now seen corresponding path program 1 times [2019-09-08 10:08:35,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:35,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:35,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:35,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:35,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:35,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:35,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:35,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:35,714 INFO L87 Difference]: Start difference. First operand 301745 states and 433307 transitions. Second operand 3 states. [2019-09-08 10:09:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:19,853 INFO L93 Difference]: Finished difference Result 646397 states and 941399 transitions. [2019-09-08 10:09:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:09:19,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 10:09:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:20,503 INFO L225 Difference]: With dead ends: 646397 [2019-09-08 10:09:20,503 INFO L226 Difference]: Without dead ends: 573203 [2019-09-08 10:09:20,634 INFO L628 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-09-08 10:09:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573203 states. [2019-09-08 10:10:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573203 to 572631. [2019-09-08 10:10:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572631 states. [2019-09-08 10:10:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572631 states to 572631 states and 822251 transitions. [2019-09-08 10:10:18,181 INFO L78 Accepts]: Start accepts. Automaton has 572631 states and 822251 transitions. Word has length 332 [2019-09-08 10:10:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:10:18,182 INFO L475 AbstractCegarLoop]: Abstraction has 572631 states and 822251 transitions. [2019-09-08 10:10:18,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:10:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 572631 states and 822251 transitions. [2019-09-08 10:10:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 10:10:18,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:10:18,668 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:10:18,668 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:10:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:10:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1631938993, now seen corresponding path program 1 times [2019-09-08 10:10:18,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:10:18,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:10:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:18,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:10:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:10:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:10:19,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:10:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:10:19,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:10:19,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:10:19,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:10:19,998 INFO L87 Difference]: Start difference. First operand 572631 states and 822251 transitions. Second operand 4 states. [2019-09-08 10:11:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:56,804 INFO L93 Difference]: Finished difference Result 1634008 states and 2344283 transitions. [2019-09-08 10:11:56,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:11:56,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 10:11:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:58,211 INFO L225 Difference]: With dead ends: 1634008 [2019-09-08 10:11:58,211 INFO L226 Difference]: Without dead ends: 1061595 [2019-09-08 10:11:58,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:11:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061595 states. [2019-09-08 10:13:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061595 to 1061495. [2019-09-08 10:13:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061495 states. [2019-09-08 10:13:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061495 states to 1061495 states and 1513099 transitions. [2019-09-08 10:13:51,313 INFO L78 Accepts]: Start accepts. Automaton has 1061495 states and 1513099 transitions. Word has length 332 [2019-09-08 10:13:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:51,314 INFO L475 AbstractCegarLoop]: Abstraction has 1061495 states and 1513099 transitions. [2019-09-08 10:13:51,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1061495 states and 1513099 transitions. [2019-09-08 10:13:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 10:13:52,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:52,400 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:13:52,400 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1318450531, now seen corresponding path program 1 times [2019-09-08 10:13:52,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:52,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:52,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:52,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:52,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:52,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:52,616 INFO L87 Difference]: Start difference. First operand 1061495 states and 1513099 transitions. Second operand 3 states.