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_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:45:19,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:45:19,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:45:19,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:45:19,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:45:19,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:45:19,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:45:19,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:45:19,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:45:19,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:45:19,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:45:19,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:45:19,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:45:19,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:45:19,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:45:19,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:45:19,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:45:19,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:45:19,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:45:19,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:45:19,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:45:19,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:45:19,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:45:19,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:45:19,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:45:19,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:45:19,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:45:19,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:45:19,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:45:19,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:45:19,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:45:19,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:45:19,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:45:19,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:45:19,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:45:19,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:45:19,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:45:19,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:45:19,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:45:19,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:45:19,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:45:19,730 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 12:45:19,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:45:19,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:45:19,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:45:19,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:45:19,747 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:45:19,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:45:19,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:45:19,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:45:19,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:45:19,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:45:19,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:45:19,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:45:19,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:45:19,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:45:19,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:45:19,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:45:19,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:45:19,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:45:19,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:45:19,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:45:19,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:45:19,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:45:19,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:45:19,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:45:19,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:45:19,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:45:19,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:45:19,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:45:19,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:45:19,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:45:19,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:45:19,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:45:19,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:45:19,800 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:45:19,801 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2019-09-08 12:45:19,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a87039f/b21a009f51434236877c39c3f974c6b6/FLAG3b69b96d4 [2019-09-08 12:45:20,334 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:45:20,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2019-09-08 12:45:20,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a87039f/b21a009f51434236877c39c3f974c6b6/FLAG3b69b96d4 [2019-09-08 12:45:20,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a87039f/b21a009f51434236877c39c3f974c6b6 [2019-09-08 12:45:20,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:45:20,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:45:20,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:45:20,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:45:20,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:45:20,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:45:20" (1/1) ... [2019-09-08 12:45:20,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534e9878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:20, skipping insertion in model container [2019-09-08 12:45:20,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:45:20" (1/1) ... [2019-09-08 12:45:20,658 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:45:20,710 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:45:21,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:45:21,211 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:45:21,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:45:21,356 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:45:21,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21 WrapperNode [2019-09-08 12:45:21,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:45:21,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:45:21,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:45:21,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:45:21,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (1/1) ... [2019-09-08 12:45:21,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (1/1) ... [2019-09-08 12:45:21,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (1/1) ... [2019-09-08 12:45:21,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (1/1) ... [2019-09-08 12:45:21,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (1/1) ... [2019-09-08 12:45:21,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (1/1) ... [2019-09-08 12:45:21,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (1/1) ... [2019-09-08 12:45:21,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:45:21,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:45:21,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:45:21,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:45:21,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (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 12:45:21,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:45:21,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:45:21,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:45:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:45:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:45:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:45:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:45:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:45:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:45:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:45:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:45:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:45:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:45:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:45:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:45:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:45:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:45:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 12:45:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:45:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:45:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:45:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:45:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:45:22,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:45:22,353 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:45:22,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:45:22 BoogieIcfgContainer [2019-09-08 12:45:22,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:45:22,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:45:22,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:45:22,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:45:22,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:45:20" (1/3) ... [2019-09-08 12:45:22,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fc0f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:45:22, skipping insertion in model container [2019-09-08 12:45:22,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:45:21" (2/3) ... [2019-09-08 12:45:22,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fc0f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:45:22, skipping insertion in model container [2019-09-08 12:45:22,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:45:22" (3/3) ... [2019-09-08 12:45:22,363 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2019-09-08 12:45:22,374 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:45:22,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:45:22,401 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:45:22,436 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:45:22,437 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:45:22,437 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:45:22,437 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:45:22,437 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:45:22,438 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:45:22,438 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:45:22,438 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:45:22,438 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:45:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-09-08 12:45:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:45:22,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:22,477 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] [2019-09-08 12:45:22,479 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1007404612, now seen corresponding path program 1 times [2019-09-08 12:45:22,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:22,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:22,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:22,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:22,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:23,093 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 12:45:23,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:23,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:23,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:23,118 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2019-09-08 12:45:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:23,248 INFO L93 Difference]: Finished difference Result 342 states and 561 transitions. [2019-09-08 12:45:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:23,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 12:45:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:23,272 INFO L225 Difference]: With dead ends: 342 [2019-09-08 12:45:23,273 INFO L226 Difference]: Without dead ends: 240 [2019-09-08 12:45:23,281 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 12:45:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-08 12:45:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2019-09-08 12:45:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 12:45:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 339 transitions. [2019-09-08 12:45:23,354 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 339 transitions. Word has length 105 [2019-09-08 12:45:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:23,355 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 339 transitions. [2019-09-08 12:45:23,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 339 transitions. [2019-09-08 12:45:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:45:23,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:23,358 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] [2019-09-08 12:45:23,358 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1646548338, now seen corresponding path program 1 times [2019-09-08 12:45:23,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:23,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:23,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:23,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:23,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:23,571 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 12:45:23,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:23,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:23,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:23,574 INFO L87 Difference]: Start difference. First operand 238 states and 339 transitions. Second operand 3 states. [2019-09-08 12:45:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:23,625 INFO L93 Difference]: Finished difference Result 562 states and 855 transitions. [2019-09-08 12:45:23,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:23,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 12:45:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:23,630 INFO L225 Difference]: With dead ends: 562 [2019-09-08 12:45:23,630 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 12:45:23,635 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 12:45:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 12:45:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2019-09-08 12:45:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-08 12:45:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 581 transitions. [2019-09-08 12:45:23,682 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 581 transitions. Word has length 106 [2019-09-08 12:45:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:23,683 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 581 transitions. [2019-09-08 12:45:23,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 581 transitions. [2019-09-08 12:45:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:45:23,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:23,686 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] [2019-09-08 12:45:23,686 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash -728502827, now seen corresponding path program 1 times [2019-09-08 12:45:23,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:23,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:23,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:23,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:23,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:23,856 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 12:45:23,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:23,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:23,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:23,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:23,860 INFO L87 Difference]: Start difference. First operand 390 states and 581 transitions. Second operand 3 states. [2019-09-08 12:45:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:23,913 INFO L93 Difference]: Finished difference Result 1002 states and 1555 transitions. [2019-09-08 12:45:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:23,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 12:45:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:23,919 INFO L225 Difference]: With dead ends: 1002 [2019-09-08 12:45:23,919 INFO L226 Difference]: Without dead ends: 680 [2019-09-08 12:45:23,920 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 12:45:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-08 12:45:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 678. [2019-09-08 12:45:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-08 12:45:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1037 transitions. [2019-09-08 12:45:23,959 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1037 transitions. Word has length 107 [2019-09-08 12:45:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:23,959 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 1037 transitions. [2019-09-08 12:45:23,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1037 transitions. [2019-09-08 12:45:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:45:23,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:23,962 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] [2019-09-08 12:45:23,962 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1065402348, now seen corresponding path program 1 times [2019-09-08 12:45:23,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:24,075 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 12:45:24,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:24,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:24,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:24,078 INFO L87 Difference]: Start difference. First operand 678 states and 1037 transitions. Second operand 3 states. [2019-09-08 12:45:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:24,152 INFO L93 Difference]: Finished difference Result 1834 states and 2871 transitions. [2019-09-08 12:45:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:24,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 12:45:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:24,164 INFO L225 Difference]: With dead ends: 1834 [2019-09-08 12:45:24,164 INFO L226 Difference]: Without dead ends: 1224 [2019-09-08 12:45:24,166 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 12:45:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-08 12:45:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1222. [2019-09-08 12:45:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-09-08 12:45:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1893 transitions. [2019-09-08 12:45:24,225 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1893 transitions. Word has length 108 [2019-09-08 12:45:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:24,226 INFO L475 AbstractCegarLoop]: Abstraction has 1222 states and 1893 transitions. [2019-09-08 12:45:24,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1893 transitions. [2019-09-08 12:45:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:45:24,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:24,234 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] [2019-09-08 12:45:24,234 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1123656391, now seen corresponding path program 1 times [2019-09-08 12:45:24,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:24,343 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 12:45:24,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:24,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:24,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:24,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:24,345 INFO L87 Difference]: Start difference. First operand 1222 states and 1893 transitions. Second operand 3 states. [2019-09-08 12:45:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:24,511 INFO L93 Difference]: Finished difference Result 3402 states and 5335 transitions. [2019-09-08 12:45:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:24,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 12:45:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:24,525 INFO L225 Difference]: With dead ends: 3402 [2019-09-08 12:45:24,526 INFO L226 Difference]: Without dead ends: 2248 [2019-09-08 12:45:24,528 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 12:45:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-09-08 12:45:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2019-09-08 12:45:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-09-08 12:45:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3493 transitions. [2019-09-08 12:45:24,648 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3493 transitions. Word has length 109 [2019-09-08 12:45:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:24,649 INFO L475 AbstractCegarLoop]: Abstraction has 2246 states and 3493 transitions. [2019-09-08 12:45:24,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3493 transitions. [2019-09-08 12:45:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:45:24,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:24,652 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] [2019-09-08 12:45:24,652 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash 392577038, now seen corresponding path program 1 times [2019-09-08 12:45:24,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:24,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:24,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:24,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:24,801 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 12:45:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:24,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:24,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:24,803 INFO L87 Difference]: Start difference. First operand 2246 states and 3493 transitions. Second operand 3 states. [2019-09-08 12:45:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:25,037 INFO L93 Difference]: Finished difference Result 6346 states and 9927 transitions. [2019-09-08 12:45:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:25,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 12:45:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:25,067 INFO L225 Difference]: With dead ends: 6346 [2019-09-08 12:45:25,067 INFO L226 Difference]: Without dead ends: 4168 [2019-09-08 12:45:25,076 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 12:45:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2019-09-08 12:45:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4166. [2019-09-08 12:45:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-09-08 12:45:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 6469 transitions. [2019-09-08 12:45:25,347 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 6469 transitions. Word has length 110 [2019-09-08 12:45:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:25,348 INFO L475 AbstractCegarLoop]: Abstraction has 4166 states and 6469 transitions. [2019-09-08 12:45:25,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 6469 transitions. [2019-09-08 12:45:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:45:25,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:25,350 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] [2019-09-08 12:45:25,354 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:25,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1201015413, now seen corresponding path program 1 times [2019-09-08 12:45:25,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:25,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:25,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:25,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:25,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:25,466 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 12:45:25,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:25,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:25,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:25,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:25,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:25,469 INFO L87 Difference]: Start difference. First operand 4166 states and 6469 transitions. Second operand 3 states. [2019-09-08 12:45:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:25,956 INFO L93 Difference]: Finished difference Result 11850 states and 18439 transitions. [2019-09-08 12:45:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:25,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 12:45:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:26,017 INFO L225 Difference]: With dead ends: 11850 [2019-09-08 12:45:26,018 INFO L226 Difference]: Without dead ends: 7752 [2019-09-08 12:45:26,035 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 12:45:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2019-09-08 12:45:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7750. [2019-09-08 12:45:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7750 states. [2019-09-08 12:45:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7750 states to 7750 states and 11973 transitions. [2019-09-08 12:45:26,538 INFO L78 Accepts]: Start accepts. Automaton has 7750 states and 11973 transitions. Word has length 111 [2019-09-08 12:45:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:26,539 INFO L475 AbstractCegarLoop]: Abstraction has 7750 states and 11973 transitions. [2019-09-08 12:45:26,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7750 states and 11973 transitions. [2019-09-08 12:45:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:45:26,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:26,540 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] [2019-09-08 12:45:26,541 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash 359653627, now seen corresponding path program 1 times [2019-09-08 12:45:26,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:26,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:26,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:26,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:26,653 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 12:45:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:45:26,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:45:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:45:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:45:26,656 INFO L87 Difference]: Start difference. First operand 7750 states and 11973 transitions. Second operand 3 states. [2019-09-08 12:45:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:27,426 INFO L93 Difference]: Finished difference Result 22090 states and 34119 transitions. [2019-09-08 12:45:27,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:27,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 12:45:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:27,538 INFO L225 Difference]: With dead ends: 22090 [2019-09-08 12:45:27,539 INFO L226 Difference]: Without dead ends: 14408 [2019-09-08 12:45:27,561 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 12:45:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14408 states. [2019-09-08 12:45:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14408 to 14406. [2019-09-08 12:45:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14406 states. [2019-09-08 12:45:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14406 states to 14406 states and 22085 transitions. [2019-09-08 12:45:28,443 INFO L78 Accepts]: Start accepts. Automaton has 14406 states and 22085 transitions. Word has length 112 [2019-09-08 12:45:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:28,444 INFO L475 AbstractCegarLoop]: Abstraction has 14406 states and 22085 transitions. [2019-09-08 12:45:28,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:45:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14406 states and 22085 transitions. [2019-09-08 12:45:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:45:28,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:28,446 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] [2019-09-08 12:45:28,446 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2063482190, now seen corresponding path program 1 times [2019-09-08 12:45:28,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:28,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:28,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:28,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:28,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:28,594 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 12:45:28,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:28,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:28,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:28,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:28,596 INFO L87 Difference]: Start difference. First operand 14406 states and 22085 transitions. Second operand 5 states. [2019-09-08 12:45:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:30,538 INFO L93 Difference]: Finished difference Result 43082 states and 66119 transitions. [2019-09-08 12:45:30,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:30,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:45:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:30,634 INFO L225 Difference]: With dead ends: 43082 [2019-09-08 12:45:30,634 INFO L226 Difference]: Without dead ends: 28744 [2019-09-08 12:45:30,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28744 states. [2019-09-08 12:45:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28744 to 28742. [2019-09-08 12:45:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-08 12:45:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43973 transitions. [2019-09-08 12:45:32,679 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43973 transitions. Word has length 113 [2019-09-08 12:45:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:32,679 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43973 transitions. [2019-09-08 12:45:32,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43973 transitions. [2019-09-08 12:45:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:45:32,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:32,681 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] [2019-09-08 12:45:32,681 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:32,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1959738441, now seen corresponding path program 1 times [2019-09-08 12:45:32,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:32,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:32,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:32,868 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 12:45:32,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:32,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:32,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:32,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:32,869 INFO L87 Difference]: Start difference. First operand 28742 states and 43973 transitions. Second operand 5 states. [2019-09-08 12:45:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:35,032 INFO L93 Difference]: Finished difference Result 57416 states and 87878 transitions. [2019-09-08 12:45:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:35,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:45:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:35,100 INFO L225 Difference]: With dead ends: 57416 [2019-09-08 12:45:35,100 INFO L226 Difference]: Without dead ends: 28742 [2019-09-08 12:45:35,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-08 12:45:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-08 12:45:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-08 12:45:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43717 transitions. [2019-09-08 12:45:36,672 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43717 transitions. Word has length 113 [2019-09-08 12:45:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:36,672 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43717 transitions. [2019-09-08 12:45:36,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43717 transitions. [2019-09-08 12:45:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:45:36,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:36,674 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] [2019-09-08 12:45:36,674 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:36,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1061360850, now seen corresponding path program 1 times [2019-09-08 12:45:36,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:36,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:36,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:36,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:36,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:36,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:36,811 INFO L87 Difference]: Start difference. First operand 28742 states and 43717 transitions. Second operand 5 states. [2019-09-08 12:45:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:37,960 INFO L93 Difference]: Finished difference Result 57416 states and 87366 transitions. [2019-09-08 12:45:37,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:37,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:45:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:38,013 INFO L225 Difference]: With dead ends: 57416 [2019-09-08 12:45:38,013 INFO L226 Difference]: Without dead ends: 28742 [2019-09-08 12:45:38,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-08 12:45:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-08 12:45:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-08 12:45:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43461 transitions. [2019-09-08 12:45:40,090 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43461 transitions. Word has length 113 [2019-09-08 12:45:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:40,090 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43461 transitions. [2019-09-08 12:45:40,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43461 transitions. [2019-09-08 12:45:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:45:40,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:40,092 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] [2019-09-08 12:45:40,092 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 474037075, now seen corresponding path program 1 times [2019-09-08 12:45:40,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:40,206 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 12:45:40,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:40,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:40,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:40,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:40,208 INFO L87 Difference]: Start difference. First operand 28742 states and 43461 transitions. Second operand 5 states. [2019-09-08 12:45:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:41,585 INFO L93 Difference]: Finished difference Result 57416 states and 86854 transitions. [2019-09-08 12:45:41,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:41,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:45:41,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:41,635 INFO L225 Difference]: With dead ends: 57416 [2019-09-08 12:45:41,636 INFO L226 Difference]: Without dead ends: 28742 [2019-09-08 12:45:41,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-08 12:45:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-08 12:45:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-08 12:45:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43205 transitions. [2019-09-08 12:45:42,678 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43205 transitions. Word has length 113 [2019-09-08 12:45:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:42,679 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43205 transitions. [2019-09-08 12:45:42,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43205 transitions. [2019-09-08 12:45:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:45:42,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:42,681 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] [2019-09-08 12:45:42,682 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1367993458, now seen corresponding path program 1 times [2019-09-08 12:45:42,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:42,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:42,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:42,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:42,924 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-09-08 12:45:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:42,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:42,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:42,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:42,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:42,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:42,943 INFO L87 Difference]: Start difference. First operand 28742 states and 43205 transitions. Second operand 5 states. [2019-09-08 12:45:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:44,104 INFO L93 Difference]: Finished difference Result 57416 states and 86342 transitions. [2019-09-08 12:45:44,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:44,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:45:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:44,157 INFO L225 Difference]: With dead ends: 57416 [2019-09-08 12:45:44,157 INFO L226 Difference]: Without dead ends: 28742 [2019-09-08 12:45:44,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-08 12:45:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-08 12:45:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-08 12:45:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 42949 transitions. [2019-09-08 12:45:45,564 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 42949 transitions. Word has length 113 [2019-09-08 12:45:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:45,564 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 42949 transitions. [2019-09-08 12:45:45,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 42949 transitions. [2019-09-08 12:45:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:45:45,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:45,566 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] [2019-09-08 12:45:45,566 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -40608269, now seen corresponding path program 1 times [2019-09-08 12:45:45,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:45,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:45,674 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 12:45:45,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:45,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:45:45,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:45:45,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:45:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:45:45,677 INFO L87 Difference]: Start difference. First operand 28742 states and 42949 transitions. Second operand 5 states. [2019-09-08 12:45:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:46,981 INFO L93 Difference]: Finished difference Result 57416 states and 85830 transitions. [2019-09-08 12:45:46,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:45:46,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:45:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:47,031 INFO L225 Difference]: With dead ends: 57416 [2019-09-08 12:45:47,031 INFO L226 Difference]: Without dead ends: 28742 [2019-09-08 12:45:47,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:45:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-08 12:45:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-08 12:45:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-08 12:45:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 42693 transitions. [2019-09-08 12:45:49,279 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 42693 transitions. Word has length 113 [2019-09-08 12:45:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:49,279 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 42693 transitions. [2019-09-08 12:45:49,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:45:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 42693 transitions. [2019-09-08 12:45:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:45:49,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:49,280 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] [2019-09-08 12:45:49,280 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1487637864, now seen corresponding path program 1 times [2019-09-08 12:45:49,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:49,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:49,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:49,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:49,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:49,514 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 12:45:49,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:49,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:45:49,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:45:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:45:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:45:49,515 INFO L87 Difference]: Start difference. First operand 28742 states and 42693 transitions. Second operand 10 states. [2019-09-08 12:46:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:10,787 INFO L93 Difference]: Finished difference Result 430178 states and 639443 transitions. [2019-09-08 12:46:10,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:10,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-08 12:46:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:11,614 INFO L225 Difference]: With dead ends: 430178 [2019-09-08 12:46:11,614 INFO L226 Difference]: Without dead ends: 401504 [2019-09-08 12:46:11,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401504 states. [2019-09-08 12:46:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401504 to 86086. [2019-09-08 12:46:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86086 states. [2019-09-08 12:46:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86086 states to 86086 states and 126917 transitions. [2019-09-08 12:46:19,572 INFO L78 Accepts]: Start accepts. Automaton has 86086 states and 126917 transitions. Word has length 113 [2019-09-08 12:46:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:19,572 INFO L475 AbstractCegarLoop]: Abstraction has 86086 states and 126917 transitions. [2019-09-08 12:46:19,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 86086 states and 126917 transitions. [2019-09-08 12:46:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:46:19,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:19,573 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] [2019-09-08 12:46:19,574 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash -269016110, now seen corresponding path program 1 times [2019-09-08 12:46:19,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:19,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:20,042 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 12:46:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:46:20,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:46:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:46:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:46:20,045 INFO L87 Difference]: Start difference. First operand 86086 states and 126917 transitions. Second operand 10 states. [2019-09-08 12:46:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:28,718 INFO L93 Difference]: Finished difference Result 200782 states and 296393 transitions. [2019-09-08 12:46:28,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:46:28,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-09-08 12:46:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:28,862 INFO L225 Difference]: With dead ends: 200782 [2019-09-08 12:46:28,863 INFO L226 Difference]: Without dead ends: 114764 [2019-09-08 12:46:28,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:46:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114764 states. [2019-09-08 12:46:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114764 to 86086. [2019-09-08 12:46:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86086 states. [2019-09-08 12:46:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86086 states to 86086 states and 126405 transitions. [2019-09-08 12:46:35,613 INFO L78 Accepts]: Start accepts. Automaton has 86086 states and 126405 transitions. Word has length 115 [2019-09-08 12:46:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:35,613 INFO L475 AbstractCegarLoop]: Abstraction has 86086 states and 126405 transitions. [2019-09-08 12:46:35,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:46:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 86086 states and 126405 transitions. [2019-09-08 12:46:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:46:35,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:35,615 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] [2019-09-08 12:46:35,615 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:35,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash -289065453, now seen corresponding path program 1 times [2019-09-08 12:46:35,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:35,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:35,702 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 12:46:35,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:35,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:46:35,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:46:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:46:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:46:35,704 INFO L87 Difference]: Start difference. First operand 86086 states and 126405 transitions. Second operand 3 states. [2019-09-08 12:46:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:44,753 INFO L93 Difference]: Finished difference Result 193100 states and 283145 transitions. [2019-09-08 12:46:44,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:46:44,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 12:46:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:44,892 INFO L225 Difference]: With dead ends: 193100 [2019-09-08 12:46:44,892 INFO L226 Difference]: Without dead ends: 107082 [2019-09-08 12:46:44,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 12:46:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107082 states. [2019-09-08 12:46:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107082 to 107080. [2019-09-08 12:46:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107080 states. [2019-09-08 12:46:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107080 states to 107080 states and 156167 transitions. [2019-09-08 12:46:53,188 INFO L78 Accepts]: Start accepts. Automaton has 107080 states and 156167 transitions. Word has length 115 [2019-09-08 12:46:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:53,188 INFO L475 AbstractCegarLoop]: Abstraction has 107080 states and 156167 transitions. [2019-09-08 12:46:53,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:46:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 107080 states and 156167 transitions. [2019-09-08 12:46:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:46:53,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:53,189 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] [2019-09-08 12:46:53,190 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 248525954, now seen corresponding path program 1 times [2019-09-08 12:46:53,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:53,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:53,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:53,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:53,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:53,296 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 12:46:53,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:53,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:46:53,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:46:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:46:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:46:53,297 INFO L87 Difference]: Start difference. First operand 107080 states and 156167 transitions. Second operand 5 states. [2019-09-08 12:47:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:09,227 INFO L93 Difference]: Finished difference Result 207624 states and 301638 transitions. [2019-09-08 12:47:09,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:47:09,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 12:47:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:09,466 INFO L225 Difference]: With dead ends: 207624 [2019-09-08 12:47:09,467 INFO L226 Difference]: Without dead ends: 207622 [2019-09-08 12:47:09,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:47:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207622 states. [2019-09-08 12:47:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207622 to 110408. [2019-09-08 12:47:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110408 states. [2019-09-08 12:47:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110408 states to 110408 states and 159367 transitions. [2019-09-08 12:47:19,208 INFO L78 Accepts]: Start accepts. Automaton has 110408 states and 159367 transitions. Word has length 116 [2019-09-08 12:47:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:19,208 INFO L475 AbstractCegarLoop]: Abstraction has 110408 states and 159367 transitions. [2019-09-08 12:47:19,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:47:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 110408 states and 159367 transitions. [2019-09-08 12:47:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:47:19,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:19,242 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:19,242 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash -144594369, now seen corresponding path program 1 times [2019-09-08 12:47:19,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:19,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:19,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:19,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:47:19,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:47:19,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:47:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:19,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 12:47:20,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:47:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:47:20,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:47:20,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-08 12:47:20,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:47:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:47:20,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:47:20,629 INFO L87 Difference]: Start difference. First operand 110408 states and 159367 transitions. Second operand 13 states. [2019-09-08 12:48:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:47,260 INFO L93 Difference]: Finished difference Result 1113604 states and 1613861 transitions. [2019-09-08 12:48:47,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:48:47,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2019-09-08 12:48:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:49,161 INFO L225 Difference]: With dead ends: 1113604 [2019-09-08 12:48:49,161 INFO L226 Difference]: Without dead ends: 1076610 [2019-09-08 12:48:49,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:48:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076610 states. [2019-09-08 12:49:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076610 to 206792. [2019-09-08 12:49:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206792 states. [2019-09-08 12:49:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206792 states to 206792 states and 298951 transitions. [2019-09-08 12:49:22,402 INFO L78 Accepts]: Start accepts. Automaton has 206792 states and 298951 transitions. Word has length 154 [2019-09-08 12:49:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:22,403 INFO L475 AbstractCegarLoop]: Abstraction has 206792 states and 298951 transitions. [2019-09-08 12:49:22,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:49:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 206792 states and 298951 transitions. [2019-09-08 12:49:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:49:22,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:22,469 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:22,469 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1701435269, now seen corresponding path program 1 times [2019-09-08 12:49:22,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:22,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:22,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:49:22,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:22,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:49:22,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:49:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:49:22,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:49:22,808 INFO L87 Difference]: Start difference. First operand 206792 states and 298951 transitions. Second operand 10 states. [2019-09-08 12:50:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:38,718 INFO L93 Difference]: Finished difference Result 876378 states and 1263120 transitions. [2019-09-08 12:50:38,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:50:38,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-08 12:50:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:39,754 INFO L225 Difference]: With dead ends: 876378 [2019-09-08 12:50:39,755 INFO L226 Difference]: Without dead ends: 669656 [2019-09-08 12:50:39,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:50:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669656 states. [2019-09-08 12:51:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669656 to 280136. [2019-09-08 12:51:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280136 states. [2019-09-08 12:51:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280136 states to 280136 states and 403655 transitions. [2019-09-08 12:51:16,040 INFO L78 Accepts]: Start accepts. Automaton has 280136 states and 403655 transitions. Word has length 154 [2019-09-08 12:51:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:16,040 INFO L475 AbstractCegarLoop]: Abstraction has 280136 states and 403655 transitions. [2019-09-08 12:51:16,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:51:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 280136 states and 403655 transitions. [2019-09-08 12:51:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:51:16,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:16,077 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:16,077 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1475196783, now seen corresponding path program 1 times [2019-09-08 12:51:16,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:16,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:16,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:16,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:51:16,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:51:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:51:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:17,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 12:51:17,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:51:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:51:17,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:51:17,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-08 12:51:17,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:51:17,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:51:17,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:51:17,330 INFO L87 Difference]: Start difference. First operand 280136 states and 403655 transitions. Second operand 13 states. [2019-09-08 12:54:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:01,342 INFO L93 Difference]: Finished difference Result 1575158 states and 2271710 transitions. [2019-09-08 12:54:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 12:54:01,343 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2019-09-08 12:54:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:03,371 INFO L225 Difference]: With dead ends: 1575158 [2019-09-08 12:54:03,371 INFO L226 Difference]: Without dead ends: 1368436 [2019-09-08 12:54:03,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=791, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:54:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368436 states. [2019-09-08 12:55:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368436 to 456648. [2019-09-08 12:55:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456648 states. [2019-09-08 12:55:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456648 states to 456648 states and 659527 transitions. [2019-09-08 12:55:21,253 INFO L78 Accepts]: Start accepts. Automaton has 456648 states and 659527 transitions. Word has length 154 [2019-09-08 12:55:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:21,254 INFO L475 AbstractCegarLoop]: Abstraction has 456648 states and 659527 transitions. [2019-09-08 12:55:21,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:55:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 456648 states and 659527 transitions. [2019-09-08 12:55:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:55:21,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:21,286 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:21,287 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash 809686941, now seen corresponding path program 1 times [2019-09-08 12:55:21,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:21,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:21,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:55:21,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:55:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:55:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:21,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 12:55:21,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:55:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:55:21,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:55:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-08 12:55:21,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:55:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:55:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:55:21,816 INFO L87 Difference]: Start difference. First operand 456648 states and 659527 transitions. Second operand 13 states.