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.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:49:20,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:49:20,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:49:20,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:49:20,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:49:20,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:49:20,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:49:20,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:49:20,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:49:20,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:49:20,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:49:20,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:49:20,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:49:20,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:49:20,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:49:20,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:49:20,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:49:20,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:49:20,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:49:20,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:49:20,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:49:20,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:49:20,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:49:20,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:49:20,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:49:20,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:49:20,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:49:20,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:49:20,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:49:20,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:49:20,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:49:20,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:49:20,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:49:20,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:49:20,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:49:20,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:49:20,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:49:20,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:49:20,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:49:20,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:49:20,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:49:20,753 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:49:20,767 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:49:20,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:49:20,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:49:20,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:49:20,769 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:49:20,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:49:20,770 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:49:20,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:49:20,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:49:20,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:49:20,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:49:20,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:49:20,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:49:20,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:49:20,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:49:20,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:49:20,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:49:20,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:49:20,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:49:20,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:49:20,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:49:20,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:49:20,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:49:20,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:49:20,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:49:20,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:49:20,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:49:20,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:49:20,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:49:20,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:49:20,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:49:20,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:49:20,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:49:20,826 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:49:20,826 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.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:49:20,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee3ebd8b/1d69a3e9e05e4a5f90a86fbef4680d18/FLAGfb77aa2d7 [2019-09-08 12:49:21,352 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:49:21,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:49:21,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee3ebd8b/1d69a3e9e05e4a5f90a86fbef4680d18/FLAGfb77aa2d7 [2019-09-08 12:49:21,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee3ebd8b/1d69a3e9e05e4a5f90a86fbef4680d18 [2019-09-08 12:49:21,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:49:21,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:49:21,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:49:21,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:49:21,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:49:21,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:49:21" (1/1) ... [2019-09-08 12:49:21,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633e5af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:21, skipping insertion in model container [2019-09-08 12:49:21,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:49:21" (1/1) ... [2019-09-08 12:49:21,680 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:49:21,736 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:49:22,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:49:22,072 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:49:22,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:49:22,330 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:49:22,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22 WrapperNode [2019-09-08 12:49:22,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:49:22,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:49:22,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:49:22,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:49:22,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (1/1) ... [2019-09-08 12:49:22,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (1/1) ... [2019-09-08 12:49:22,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (1/1) ... [2019-09-08 12:49:22,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (1/1) ... [2019-09-08 12:49:22,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (1/1) ... [2019-09-08 12:49:22,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (1/1) ... [2019-09-08 12:49:22,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (1/1) ... [2019-09-08 12:49:22,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:49:22,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:49:22,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:49:22,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:49:22,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (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:49:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:49:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:49:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:49:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:49:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:49:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:49:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:49:22,477 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:49:22,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:49:22,477 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:49:22,478 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:49:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:49:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:49:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:49:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:49:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:49:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:49:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:49:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 12:49:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:49:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:49:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:49:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:49:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:49:23,401 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:49:23,402 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:49:23,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:49:23 BoogieIcfgContainer [2019-09-08 12:49:23,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:49:23,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:49:23,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:49:23,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:49:23,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:49:21" (1/3) ... [2019-09-08 12:49:23,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28721468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:49:23, skipping insertion in model container [2019-09-08 12:49:23,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:22" (2/3) ... [2019-09-08 12:49:23,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28721468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:49:23, skipping insertion in model container [2019-09-08 12:49:23,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:49:23" (3/3) ... [2019-09-08 12:49:23,412 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:49:23,422 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:49:23,431 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:49:23,448 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:49:23,481 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:49:23,482 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:49:23,482 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:49:23,482 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:49:23,483 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:49:23,483 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:49:23,483 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:49:23,483 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:49:23,483 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:49:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2019-09-08 12:49:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:49:23,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:23,519 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:49:23,521 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1286510707, now seen corresponding path program 1 times [2019-09-08 12:49:23,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:23,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:23,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:24,122 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:49:24,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:49:24,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:49:24,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:49:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:49:24,147 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2019-09-08 12:49:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:24,287 INFO L93 Difference]: Finished difference Result 348 states and 567 transitions. [2019-09-08 12:49:24,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:49:24,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 12:49:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:24,316 INFO L225 Difference]: With dead ends: 348 [2019-09-08 12:49:24,316 INFO L226 Difference]: Without dead ends: 244 [2019-09-08 12:49:24,325 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:49:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-08 12:49:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2019-09-08 12:49:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-08 12:49:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2019-09-08 12:49:24,447 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 106 [2019-09-08 12:49:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:24,448 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2019-09-08 12:49:24,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:49:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2019-09-08 12:49:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:49:24,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:24,453 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:49:24,453 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash 995232503, now seen corresponding path program 1 times [2019-09-08 12:49:24,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:24,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:24,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:24,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:49:24,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:49:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:49:24,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:49:24,716 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 3 states. [2019-09-08 12:49:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:24,791 INFO L93 Difference]: Finished difference Result 574 states and 873 transitions. [2019-09-08 12:49:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:49:24,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 12:49:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:24,796 INFO L225 Difference]: With dead ends: 574 [2019-09-08 12:49:24,796 INFO L226 Difference]: Without dead ends: 400 [2019-09-08 12:49:24,800 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:49:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-08 12:49:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2019-09-08 12:49:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-08 12:49:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 593 transitions. [2019-09-08 12:49:24,861 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 593 transitions. Word has length 107 [2019-09-08 12:49:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:24,861 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 593 transitions. [2019-09-08 12:49:24,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:49:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 593 transitions. [2019-09-08 12:49:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:49:24,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:24,864 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:49:24,867 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash -496599856, now seen corresponding path program 1 times [2019-09-08 12:49:24,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:24,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:24,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:25,045 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:49:25,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:25,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:49:25,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:49:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:49:25,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:49:25,052 INFO L87 Difference]: Start difference. First operand 398 states and 593 transitions. Second operand 3 states. [2019-09-08 12:49:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:25,142 INFO L93 Difference]: Finished difference Result 1026 states and 1591 transitions. [2019-09-08 12:49:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:49:25,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 12:49:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:25,163 INFO L225 Difference]: With dead ends: 1026 [2019-09-08 12:49:25,163 INFO L226 Difference]: Without dead ends: 696 [2019-09-08 12:49:25,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:49:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-08 12:49:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 694. [2019-09-08 12:49:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-08 12:49:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1061 transitions. [2019-09-08 12:49:25,206 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1061 transitions. Word has length 108 [2019-09-08 12:49:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:25,207 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1061 transitions. [2019-09-08 12:49:25,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:49:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1061 transitions. [2019-09-08 12:49:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:49:25,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:25,213 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:49:25,213 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash -670648320, now seen corresponding path program 1 times [2019-09-08 12:49:25,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:25,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:25,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:25,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:25,314 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:49:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:49:25,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:49:25,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:49:25,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:49:25,316 INFO L87 Difference]: Start difference. First operand 694 states and 1061 transitions. Second operand 3 states. [2019-09-08 12:49:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:25,382 INFO L93 Difference]: Finished difference Result 1882 states and 2943 transitions. [2019-09-08 12:49:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:49:25,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 12:49:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:25,392 INFO L225 Difference]: With dead ends: 1882 [2019-09-08 12:49:25,392 INFO L226 Difference]: Without dead ends: 1256 [2019-09-08 12:49:25,394 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:49:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-08 12:49:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1254. [2019-09-08 12:49:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-09-08 12:49:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1941 transitions. [2019-09-08 12:49:25,455 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1941 transitions. Word has length 109 [2019-09-08 12:49:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:25,456 INFO L475 AbstractCegarLoop]: Abstraction has 1254 states and 1941 transitions. [2019-09-08 12:49:25,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:49:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1941 transitions. [2019-09-08 12:49:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:49:25,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:25,458 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:49:25,458 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1550925354, now seen corresponding path program 1 times [2019-09-08 12:49:25,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:25,559 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:49:25,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:25,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:49:25,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:49:25,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:49:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:49:25,561 INFO L87 Difference]: Start difference. First operand 1254 states and 1941 transitions. Second operand 3 states. [2019-09-08 12:49:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:25,675 INFO L93 Difference]: Finished difference Result 3498 states and 5479 transitions. [2019-09-08 12:49:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:49:25,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 12:49:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:25,689 INFO L225 Difference]: With dead ends: 3498 [2019-09-08 12:49:25,689 INFO L226 Difference]: Without dead ends: 2312 [2019-09-08 12:49:25,693 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:49:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-09-08 12:49:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2310. [2019-09-08 12:49:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2310 states. [2019-09-08 12:49:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3589 transitions. [2019-09-08 12:49:25,841 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3589 transitions. Word has length 110 [2019-09-08 12:49:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:25,841 INFO L475 AbstractCegarLoop]: Abstraction has 2310 states and 3589 transitions. [2019-09-08 12:49:25,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:49:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3589 transitions. [2019-09-08 12:49:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:49:25,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:25,843 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:49:25,843 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:25,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1544892452, now seen corresponding path program 1 times [2019-09-08 12:49:25,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:25,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:25,937 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:49:25,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:25,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:49:25,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:49:25,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:49:25,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:49:25,938 INFO L87 Difference]: Start difference. First operand 2310 states and 3589 transitions. Second operand 3 states. [2019-09-08 12:49:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:26,128 INFO L93 Difference]: Finished difference Result 6538 states and 10215 transitions. [2019-09-08 12:49:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:49:26,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 12:49:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:26,152 INFO L225 Difference]: With dead ends: 6538 [2019-09-08 12:49:26,152 INFO L226 Difference]: Without dead ends: 4296 [2019-09-08 12:49:26,158 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:49:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-09-08 12:49:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4294. [2019-09-08 12:49:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4294 states. [2019-09-08 12:49:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 6661 transitions. [2019-09-08 12:49:26,426 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 6661 transitions. Word has length 111 [2019-09-08 12:49:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:26,430 INFO L475 AbstractCegarLoop]: Abstraction has 4294 states and 6661 transitions. [2019-09-08 12:49:26,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:49:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 6661 transitions. [2019-09-08 12:49:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:49:26,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:26,441 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:49:26,442 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1907719388, now seen corresponding path program 1 times [2019-09-08 12:49:26,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:26,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:26,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:26,585 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:49:26,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:26,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:49:26,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:49:26,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:49:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:49:26,587 INFO L87 Difference]: Start difference. First operand 4294 states and 6661 transitions. Second operand 3 states. [2019-09-08 12:49:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:26,945 INFO L93 Difference]: Finished difference Result 12234 states and 19015 transitions. [2019-09-08 12:49:26,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:49:26,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 12:49:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:26,988 INFO L225 Difference]: With dead ends: 12234 [2019-09-08 12:49:26,988 INFO L226 Difference]: Without dead ends: 8008 [2019-09-08 12:49:26,999 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:49:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2019-09-08 12:49:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 8006. [2019-09-08 12:49:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8006 states. [2019-09-08 12:49:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8006 states to 8006 states and 12357 transitions. [2019-09-08 12:49:27,480 INFO L78 Accepts]: Start accepts. Automaton has 8006 states and 12357 transitions. Word has length 112 [2019-09-08 12:49:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:27,481 INFO L475 AbstractCegarLoop]: Abstraction has 8006 states and 12357 transitions. [2019-09-08 12:49:27,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:49:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8006 states and 12357 transitions. [2019-09-08 12:49:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:49:27,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:27,483 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:49:27,483 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1486086768, now seen corresponding path program 1 times [2019-09-08 12:49:27,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:27,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:27,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:27,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:27,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:27,632 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:49:27,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:27,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:49:27,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:49:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:49:27,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:49:27,635 INFO L87 Difference]: Start difference. First operand 8006 states and 12357 transitions. Second operand 5 states. [2019-09-08 12:49:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:28,843 INFO L93 Difference]: Finished difference Result 23882 states and 36935 transitions. [2019-09-08 12:49:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:49:28,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:49:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:28,950 INFO L225 Difference]: With dead ends: 23882 [2019-09-08 12:49:28,951 INFO L226 Difference]: Without dead ends: 15944 [2019-09-08 12:49:28,969 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:49:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15944 states. [2019-09-08 12:49:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15944 to 15942. [2019-09-08 12:49:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-08 12:49:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24517 transitions. [2019-09-08 12:49:29,845 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24517 transitions. Word has length 113 [2019-09-08 12:49:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:29,846 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24517 transitions. [2019-09-08 12:49:29,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:49:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24517 transitions. [2019-09-08 12:49:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:49:29,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:29,847 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:49:29,848 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1589830517, now seen corresponding path program 1 times [2019-09-08 12:49:29,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:29,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:29,967 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:49:29,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:29,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:49:29,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:49:29,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:49:29,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:49:29,969 INFO L87 Difference]: Start difference. First operand 15942 states and 24517 transitions. Second operand 5 states. [2019-09-08 12:49:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:31,327 INFO L93 Difference]: Finished difference Result 31816 states and 48966 transitions. [2019-09-08 12:49:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:49:31,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:49:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:31,378 INFO L225 Difference]: With dead ends: 31816 [2019-09-08 12:49:31,378 INFO L226 Difference]: Without dead ends: 15942 [2019-09-08 12:49:31,425 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:49:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-08 12:49:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-08 12:49:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-08 12:49:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24389 transitions. [2019-09-08 12:49:32,503 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24389 transitions. Word has length 113 [2019-09-08 12:49:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:32,504 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24389 transitions. [2019-09-08 12:49:32,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:49:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24389 transitions. [2019-09-08 12:49:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:49:32,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:32,505 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:49:32,506 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:32,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash -315962512, now seen corresponding path program 1 times [2019-09-08 12:49:32,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:32,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:32,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:32,626 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:49:32,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:32,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:49:32,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:49:32,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:49:32,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:49:32,628 INFO L87 Difference]: Start difference. First operand 15942 states and 24389 transitions. Second operand 5 states. [2019-09-08 12:49:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:33,569 INFO L93 Difference]: Finished difference Result 31816 states and 48710 transitions. [2019-09-08 12:49:33,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:49:33,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:49:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:33,615 INFO L225 Difference]: With dead ends: 31816 [2019-09-08 12:49:33,615 INFO L226 Difference]: Without dead ends: 15942 [2019-09-08 12:49:33,658 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:49:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-08 12:49:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-08 12:49:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-08 12:49:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24261 transitions. [2019-09-08 12:49:34,614 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24261 transitions. Word has length 113 [2019-09-08 12:49:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:34,615 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24261 transitions. [2019-09-08 12:49:34,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:49:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24261 transitions. [2019-09-08 12:49:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:49:34,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:34,617 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:49:34,617 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1219435413, now seen corresponding path program 1 times [2019-09-08 12:49:34,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:34,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:34,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:34,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:34,742 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:49:34,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:34,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:49:34,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:49:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:49:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:49:34,745 INFO L87 Difference]: Start difference. First operand 15942 states and 24261 transitions. Second operand 5 states. [2019-09-08 12:49:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:36,014 INFO L93 Difference]: Finished difference Result 31816 states and 48454 transitions. [2019-09-08 12:49:36,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:49:36,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:49:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:36,048 INFO L225 Difference]: With dead ends: 31816 [2019-09-08 12:49:36,048 INFO L226 Difference]: Without dead ends: 15942 [2019-09-08 12:49:36,077 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:49:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-08 12:49:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-08 12:49:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-08 12:49:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24133 transitions. [2019-09-08 12:49:36,906 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24133 transitions. Word has length 113 [2019-09-08 12:49:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:36,907 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24133 transitions. [2019-09-08 12:49:36,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:49:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24133 transitions. [2019-09-08 12:49:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:49:36,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:36,909 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:49:36,909 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1748146694, now seen corresponding path program 1 times [2019-09-08 12:49:36,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:36,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:36,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:36,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:36,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:37,031 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:49:37,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:37,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:49:37,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:49:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:49:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:49:37,033 INFO L87 Difference]: Start difference. First operand 15942 states and 24133 transitions. Second operand 5 states. [2019-09-08 12:49:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:37,810 INFO L93 Difference]: Finished difference Result 31816 states and 48198 transitions. [2019-09-08 12:49:37,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:49:37,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:49:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:37,839 INFO L225 Difference]: With dead ends: 31816 [2019-09-08 12:49:37,839 INFO L226 Difference]: Without dead ends: 15942 [2019-09-08 12:49:37,857 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:49:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-08 12:49:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-08 12:49:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-08 12:49:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24005 transitions. [2019-09-08 12:49:38,978 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24005 transitions. Word has length 113 [2019-09-08 12:49:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:38,979 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24005 transitions. [2019-09-08 12:49:38,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:49:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24005 transitions. [2019-09-08 12:49:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:49:38,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:38,982 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:49:38,983 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:38,983 INFO L82 PathProgramCache]: Analyzing trace with hash -26815819, now seen corresponding path program 1 times [2019-09-08 12:49:38,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:38,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:38,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:38,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:38,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:39,120 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:49:39,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:39,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:49:39,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:49:39,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:49:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:49:39,122 INFO L87 Difference]: Start difference. First operand 15942 states and 24005 transitions. Second operand 5 states. [2019-09-08 12:49:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:39,777 INFO L93 Difference]: Finished difference Result 31816 states and 47942 transitions. [2019-09-08 12:49:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:49:39,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-08 12:49:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:39,805 INFO L225 Difference]: With dead ends: 31816 [2019-09-08 12:49:39,806 INFO L226 Difference]: Without dead ends: 15942 [2019-09-08 12:49:39,824 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:49:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-08 12:49:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-08 12:49:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-08 12:49:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 23877 transitions. [2019-09-08 12:49:41,418 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 23877 transitions. Word has length 113 [2019-09-08 12:49:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:41,418 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 23877 transitions. [2019-09-08 12:49:41,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:49:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 23877 transitions. [2019-09-08 12:49:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:49:41,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:41,420 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:49:41,420 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:41,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1473845414, now seen corresponding path program 1 times [2019-09-08 12:49:41,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:41,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:41,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:41,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:49:41,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:41,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:49:41,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:49:41,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:49:41,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:49:41,655 INFO L87 Difference]: Start difference. First operand 15942 states and 23877 transitions. Second operand 10 states. [2019-09-08 12:49:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:52,944 INFO L93 Difference]: Finished difference Result 238178 states and 357203 transitions. [2019-09-08 12:49:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:52,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-08 12:49:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:53,415 INFO L225 Difference]: With dead ends: 238178 [2019-09-08 12:49:53,416 INFO L226 Difference]: Without dead ends: 222304 [2019-09-08 12:49:53,484 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:49:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222304 states. [2019-09-08 12:49:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222304 to 47686. [2019-09-08 12:49:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47686 states. [2019-09-08 12:50:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47686 states to 47686 states and 70981 transitions. [2019-09-08 12:50:00,039 INFO L78 Accepts]: Start accepts. Automaton has 47686 states and 70981 transitions. Word has length 113 [2019-09-08 12:50:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:00,039 INFO L475 AbstractCegarLoop]: Abstraction has 47686 states and 70981 transitions. [2019-09-08 12:50:00,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:50:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47686 states and 70981 transitions. [2019-09-08 12:50:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:50:00,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:00,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:00,041 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash 100626548, now seen corresponding path program 1 times [2019-09-08 12:50:00,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:00,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:00,513 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:50:00,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:00,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:50:00,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:50:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:50:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:50:00,515 INFO L87 Difference]: Start difference. First operand 47686 states and 70981 transitions. Second operand 10 states. [2019-09-08 12:50:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:04,796 INFO L93 Difference]: Finished difference Result 111182 states and 165705 transitions. [2019-09-08 12:50:04,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:50:04,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-09-08 12:50:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:04,895 INFO L225 Difference]: With dead ends: 111182 [2019-09-08 12:50:04,895 INFO L226 Difference]: Without dead ends: 63564 [2019-09-08 12:50:04,953 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:50:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63564 states. [2019-09-08 12:50:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63564 to 47686. [2019-09-08 12:50:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47686 states. [2019-09-08 12:50:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47686 states to 47686 states and 70725 transitions. [2019-09-08 12:50:08,363 INFO L78 Accepts]: Start accepts. Automaton has 47686 states and 70725 transitions. Word has length 115 [2019-09-08 12:50:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:08,364 INFO L475 AbstractCegarLoop]: Abstraction has 47686 states and 70725 transitions. [2019-09-08 12:50:08,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:50:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 47686 states and 70725 transitions. [2019-09-08 12:50:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:50:08,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:08,365 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:50:08,366 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:08,366 INFO L82 PathProgramCache]: Analyzing trace with hash 80577205, now seen corresponding path program 1 times [2019-09-08 12:50:08,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:08,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:08,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:08,463 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:50:08,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:08,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:50:08,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:50:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:50:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:50:08,465 INFO L87 Difference]: Start difference. First operand 47686 states and 70725 transitions. Second operand 3 states. [2019-09-08 12:50:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:13,761 INFO L93 Difference]: Finished difference Result 117066 states and 172935 transitions. [2019-09-08 12:50:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:50:13,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 12:50:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:13,833 INFO L225 Difference]: With dead ends: 117066 [2019-09-08 12:50:13,833 INFO L226 Difference]: Without dead ends: 69448 [2019-09-08 12:50:13,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:50:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69448 states. [2019-09-08 12:50:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69448 to 69062. [2019-09-08 12:50:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69062 states. [2019-09-08 12:50:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69062 states to 69062 states and 100869 transitions. [2019-09-08 12:50:18,657 INFO L78 Accepts]: Start accepts. Automaton has 69062 states and 100869 transitions. Word has length 115 [2019-09-08 12:50:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:18,658 INFO L475 AbstractCegarLoop]: Abstraction has 69062 states and 100869 transitions. [2019-09-08 12:50:18,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:50:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 69062 states and 100869 transitions. [2019-09-08 12:50:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:50:18,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:18,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:18,659 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:18,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1177453533, now seen corresponding path program 1 times [2019-09-08 12:50:18,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:18,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:18,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:18,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:18,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:18,772 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:50:18,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:18,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:18,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:18,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:18,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:18,773 INFO L87 Difference]: Start difference. First operand 69062 states and 100869 transitions. Second operand 5 states. [2019-09-08 12:50:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:28,309 INFO L93 Difference]: Finished difference Result 129801 states and 189316 transitions. [2019-09-08 12:50:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:50:28,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 12:50:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:28,445 INFO L225 Difference]: With dead ends: 129801 [2019-09-08 12:50:28,445 INFO L226 Difference]: Without dead ends: 129799 [2019-09-08 12:50:28,471 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:50:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129799 states. [2019-09-08 12:50:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129799 to 70854. [2019-09-08 12:50:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70854 states. [2019-09-08 12:50:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70854 states to 70854 states and 102533 transitions. [2019-09-08 12:50:34,271 INFO L78 Accepts]: Start accepts. Automaton has 70854 states and 102533 transitions. Word has length 116 [2019-09-08 12:50:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:34,272 INFO L475 AbstractCegarLoop]: Abstraction has 70854 states and 102533 transitions. [2019-09-08 12:50:34,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 70854 states and 102533 transitions. [2019-09-08 12:50:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:50:34,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:34,273 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:50:34,273 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1245567265, now seen corresponding path program 1 times [2019-09-08 12:50:34,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:34,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:34,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:34,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:34,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:34,348 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:50:34,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:34,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:50:34,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:50:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:50:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:50:34,350 INFO L87 Difference]: Start difference. First operand 70854 states and 102533 transitions. Second operand 3 states. [2019-09-08 12:50:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:44,381 INFO L93 Difference]: Finished difference Result 161485 states and 235019 transitions. [2019-09-08 12:50:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:50:44,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 12:50:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:44,494 INFO L225 Difference]: With dead ends: 161485 [2019-09-08 12:50:44,494 INFO L226 Difference]: Without dead ends: 112330 [2019-09-08 12:50:44,529 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:50:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112330 states. [2019-09-08 12:50:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112330 to 112328. [2019-09-08 12:50:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112328 states. [2019-09-08 12:50:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112328 states to 112328 states and 162055 transitions. [2019-09-08 12:50:52,969 INFO L78 Accepts]: Start accepts. Automaton has 112328 states and 162055 transitions. Word has length 116 [2019-09-08 12:50:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:52,969 INFO L475 AbstractCegarLoop]: Abstraction has 112328 states and 162055 transitions. [2019-09-08 12:50:52,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:50:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 112328 states and 162055 transitions. [2019-09-08 12:50:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:50:52,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:52,998 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-08 12:50:52,998 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2023003395, now seen corresponding path program 1 times [2019-09-08 12:50:52,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:53,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:53,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:50:53,179 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:50:53,196 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:50:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:53,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 12:50:53,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:50:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:50:53,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:50:53,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-08 12:50:53,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:50:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:50:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:50:53,739 INFO L87 Difference]: Start difference. First operand 112328 states and 162055 transitions. Second operand 13 states. [2019-09-08 12:52:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:21,578 INFO L93 Difference]: Finished difference Result 1132932 states and 1641125 transitions. [2019-09-08 12:52:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:52:21,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2019-09-08 12:52:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:23,716 INFO L225 Difference]: With dead ends: 1132932 [2019-09-08 12:52:23,716 INFO L226 Difference]: Without dead ends: 1095298 [2019-09-08 12:52:23,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 149 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:52:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095298 states. [2019-09-08 12:53:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095298 to 210376. [2019-09-08 12:53:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210376 states. [2019-09-08 12:53:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210376 states to 210376 states and 304071 transitions. [2019-09-08 12:53:04,214 INFO L78 Accepts]: Start accepts. Automaton has 210376 states and 304071 transitions. Word has length 155 [2019-09-08 12:53:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:04,215 INFO L475 AbstractCegarLoop]: Abstraction has 210376 states and 304071 transitions. [2019-09-08 12:53:04,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:53:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 210376 states and 304071 transitions. [2019-09-08 12:53:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:53:04,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:04,249 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-08 12:53:04,250 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:04,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:04,251 INFO L82 PathProgramCache]: Analyzing trace with hash -176973757, now seen corresponding path program 1 times [2019-09-08 12:53:04,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:04,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:04,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:04,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:53:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:53:04,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:53:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:53:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:53:04,636 INFO L87 Difference]: Start difference. First operand 210376 states and 304071 transitions. Second operand 10 states. [2019-09-08 12:54:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:19,332 INFO L93 Difference]: Finished difference Result 891610 states and 1284752 transitions. [2019-09-08 12:54:19,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:54:19,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-08 12:54:19,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:20,514 INFO L225 Difference]: With dead ends: 891610 [2019-09-08 12:54:20,514 INFO L226 Difference]: Without dead ends: 681304 [2019-09-08 12:54:20,739 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:54:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681304 states. [2019-09-08 12:55:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681304 to 285000. [2019-09-08 12:55:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285000 states. [2019-09-08 12:55:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285000 states to 285000 states and 410567 transitions. [2019-09-08 12:55:09,029 INFO L78 Accepts]: Start accepts. Automaton has 285000 states and 410567 transitions. Word has length 155 [2019-09-08 12:55:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:09,029 INFO L475 AbstractCegarLoop]: Abstraction has 285000 states and 410567 transitions. [2019-09-08 12:55:09,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:55:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 285000 states and 410567 transitions. [2019-09-08 12:55:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:55:09,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:09,058 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-08 12:55:09,058 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash 941361487, now seen corresponding path program 1 times [2019-09-08 12:55:09,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:09,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:09,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:09,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:55:09,223 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:55:09,238 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:55:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:09,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 12:55:09,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:55:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 12:55:10,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:55:10,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-08 12:55:10,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:55:10,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:55:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:55:10,153 INFO L87 Difference]: Start difference. First operand 285000 states and 410567 transitions. Second operand 13 states. [2019-09-08 12:58:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:05,745 INFO L93 Difference]: Finished difference Result 1602550 states and 2310622 transitions. [2019-09-08 12:58:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 12:58:05,745 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2019-09-08 12:58:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:07,939 INFO L225 Difference]: With dead ends: 1602550 [2019-09-08 12:58:07,939 INFO L226 Difference]: Without dead ends: 1392244 [2019-09-08 12:58:08,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=791, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:58:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392244 states. [2019-09-08 12:59:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392244 to 464584. [2019-09-08 12:59:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464584 states. [2019-09-08 12:59:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464584 states to 464584 states and 670791 transitions. [2019-09-08 12:59:27,684 INFO L78 Accepts]: Start accepts. Automaton has 464584 states and 670791 transitions. Word has length 155 [2019-09-08 12:59:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:27,685 INFO L475 AbstractCegarLoop]: Abstraction has 464584 states and 670791 transitions. [2019-09-08 12:59:27,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:59:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 464584 states and 670791 transitions. [2019-09-08 12:59:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:59:27,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:27,713 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-09-08 12:59:27,713 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1068722085, now seen corresponding path program 1 times [2019-09-08 12:59:27,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:27,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:27,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:27,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:59:27,875 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:59:27,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:28,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 12:59:28,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:59:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 12:59:28,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:59:28,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2019-09-08 12:59:28,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:59:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:59:28,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:59:28,376 INFO L87 Difference]: Start difference. First operand 464584 states and 670791 transitions. Second operand 13 states.