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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:37:06,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:37:06,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:37:06,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:37:06,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:37:06,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:37:06,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:37:06,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:37:06,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:37:06,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:37:06,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:37:06,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:37:06,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:37:06,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:37:06,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:37:06,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:37:06,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:37:06,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:37:06,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:37:06,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:37:06,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:37:06,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:37:06,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:37:06,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:37:06,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:37:06,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:37:06,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:37:06,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:37:06,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:37:06,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:37:06,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:37:06,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:37:06,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:37:06,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:37:06,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:37:06,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:37:06,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:37:06,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:37:06,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:37:06,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:37:06,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:37:06,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:37:06,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:37:06,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:37:06,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:37:06,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:37:06,167 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:37:06,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:37:06,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:37:06,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:37:06,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:37:06,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:37:06,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:37:06,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:37:06,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:37:06,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:37:06,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:37:06,170 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:37:06,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:37:06,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:37:06,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:37:06,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:37:06,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:37:06,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:37:06,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:37:06,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:37:06,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:37:06,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:37:06,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:37:06,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:37:06,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:37:06,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:37:06,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:37:06,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:37:06,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:37:06,218 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:37:06,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:37:06,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d794a4e8f/4592bcca81ba45298acb692baba5761b/FLAG820eabf9d [2019-09-08 10:37:07,010 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:37:07,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:37:07,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d794a4e8f/4592bcca81ba45298acb692baba5761b/FLAG820eabf9d [2019-09-08 10:37:07,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d794a4e8f/4592bcca81ba45298acb692baba5761b [2019-09-08 10:37:07,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:37:07,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:37:07,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:37:07,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:37:07,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:37:07,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:37:07" (1/1) ... [2019-09-08 10:37:07,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be9f6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:07, skipping insertion in model container [2019-09-08 10:37:07,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:37:07" (1/1) ... [2019-09-08 10:37:07,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:37:07,291 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:37:08,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:37:08,563 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:37:09,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:37:09,038 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:37:09,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09 WrapperNode [2019-09-08 10:37:09,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:37:09,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:37:09,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:37:09,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:37:09,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... [2019-09-08 10:37:09,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... [2019-09-08 10:37:09,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... [2019-09-08 10:37:09,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... [2019-09-08 10:37:09,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... [2019-09-08 10:37:09,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... [2019-09-08 10:37:09,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... [2019-09-08 10:37:09,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:37:09,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:37:09,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:37:09,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:37:09,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:37:09,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:37:09,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:37:09,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:37:09,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:37:09,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:37:09,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:37:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:37:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:37:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:37:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:37:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:37:09,404 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:37:09,405 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:37:09,405 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:37:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:37:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:37:09,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:37:09,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:37:09,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:37:13,554 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:37:13,554 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:37:13,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:37:13 BoogieIcfgContainer [2019-09-08 10:37:13,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:37:13,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:37:13,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:37:13,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:37:13,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:37:07" (1/3) ... [2019-09-08 10:37:13,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77601b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:37:13, skipping insertion in model container [2019-09-08 10:37:13,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:37:09" (2/3) ... [2019-09-08 10:37:13,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77601b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:37:13, skipping insertion in model container [2019-09-08 10:37:13,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:37:13" (3/3) ... [2019-09-08 10:37:13,564 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 10:37:13,574 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:37:13,584 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-08 10:37:13,602 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-08 10:37:13,640 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:37:13,641 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:37:13,641 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:37:13,641 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:37:13,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:37:13,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:37:13,641 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:37:13,642 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:37:13,642 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:37:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states. [2019-09-08 10:37:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:37:13,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:13,702 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] [2019-09-08 10:37:13,705 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:13,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:13,712 INFO L82 PathProgramCache]: Analyzing trace with hash 971331392, now seen corresponding path program 1 times [2019-09-08 10:37:13,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:13,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:13,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:14,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:14,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:37:14,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:37:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:37:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:14,505 INFO L87 Difference]: Start difference. First operand 1111 states. Second operand 5 states. [2019-09-08 10:37:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:15,779 INFO L93 Difference]: Finished difference Result 1808 states and 3294 transitions. [2019-09-08 10:37:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:15,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:37:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:15,817 INFO L225 Difference]: With dead ends: 1808 [2019-09-08 10:37:15,818 INFO L226 Difference]: Without dead ends: 998 [2019-09-08 10:37:15,832 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 10:37:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-08 10:37:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 990. [2019-09-08 10:37:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-09-08 10:37:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1319 transitions. [2019-09-08 10:37:15,983 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1319 transitions. Word has length 68 [2019-09-08 10:37:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:15,984 INFO L475 AbstractCegarLoop]: Abstraction has 990 states and 1319 transitions. [2019-09-08 10:37:15,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:37:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1319 transitions. [2019-09-08 10:37:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:37:15,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:15,993 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] [2019-09-08 10:37:15,994 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1328541618, now seen corresponding path program 1 times [2019-09-08 10:37:15,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:15,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:16,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:16,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:16,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:16,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:16,275 INFO L87 Difference]: Start difference. First operand 990 states and 1319 transitions. Second operand 3 states. [2019-09-08 10:37:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:16,360 INFO L93 Difference]: Finished difference Result 1963 states and 2701 transitions. [2019-09-08 10:37:16,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:16,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:37:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:16,370 INFO L225 Difference]: With dead ends: 1963 [2019-09-08 10:37:16,370 INFO L226 Difference]: Without dead ends: 1565 [2019-09-08 10:37:16,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-09-08 10:37:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1556. [2019-09-08 10:37:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-09-08 10:37:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2096 transitions. [2019-09-08 10:37:16,429 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2096 transitions. Word has length 69 [2019-09-08 10:37:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:16,429 INFO L475 AbstractCegarLoop]: Abstraction has 1556 states and 2096 transitions. [2019-09-08 10:37:16,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2096 transitions. [2019-09-08 10:37:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:37:16,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:16,434 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] [2019-09-08 10:37:16,434 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash 619214809, now seen corresponding path program 1 times [2019-09-08 10:37:16,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:16,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:16,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:16,565 INFO L87 Difference]: Start difference. First operand 1556 states and 2096 transitions. Second operand 3 states. [2019-09-08 10:37:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:16,682 INFO L93 Difference]: Finished difference Result 2659 states and 3734 transitions. [2019-09-08 10:37:16,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:16,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:37:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:16,694 INFO L225 Difference]: With dead ends: 2659 [2019-09-08 10:37:16,695 INFO L226 Difference]: Without dead ends: 2047 [2019-09-08 10:37:16,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2019-09-08 10:37:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2039. [2019-09-08 10:37:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-09-08 10:37:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2799 transitions. [2019-09-08 10:37:16,777 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2799 transitions. Word has length 69 [2019-09-08 10:37:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:16,777 INFO L475 AbstractCegarLoop]: Abstraction has 2039 states and 2799 transitions. [2019-09-08 10:37:16,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2799 transitions. [2019-09-08 10:37:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:37:16,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:16,783 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] [2019-09-08 10:37:16,784 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash 211809038, now seen corresponding path program 1 times [2019-09-08 10:37:16,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:16,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:16,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:16,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:16,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:16,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:16,919 INFO L87 Difference]: Start difference. First operand 2039 states and 2799 transitions. Second operand 3 states. [2019-09-08 10:37:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:17,191 INFO L93 Difference]: Finished difference Result 3821 states and 5402 transitions. [2019-09-08 10:37:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:17,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:37:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:17,211 INFO L225 Difference]: With dead ends: 3821 [2019-09-08 10:37:17,212 INFO L226 Difference]: Without dead ends: 2953 [2019-09-08 10:37:17,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2019-09-08 10:37:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2945. [2019-09-08 10:37:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2019-09-08 10:37:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4081 transitions. [2019-09-08 10:37:17,384 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4081 transitions. Word has length 69 [2019-09-08 10:37:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:17,385 INFO L475 AbstractCegarLoop]: Abstraction has 2945 states and 4081 transitions. [2019-09-08 10:37:17,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4081 transitions. [2019-09-08 10:37:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:37:17,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:17,395 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] [2019-09-08 10:37:17,395 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2052603823, now seen corresponding path program 1 times [2019-09-08 10:37:17,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:17,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:17,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:17,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:17,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:17,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:17,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:17,588 INFO L87 Difference]: Start difference. First operand 2945 states and 4081 transitions. Second operand 6 states. [2019-09-08 10:37:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:18,659 INFO L93 Difference]: Finished difference Result 8186 states and 11596 transitions. [2019-09-08 10:37:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:18,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:37:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:18,688 INFO L225 Difference]: With dead ends: 8186 [2019-09-08 10:37:18,688 INFO L226 Difference]: Without dead ends: 5571 [2019-09-08 10:37:18,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:37:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2019-09-08 10:37:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 5555. [2019-09-08 10:37:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5555 states. [2019-09-08 10:37:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 7873 transitions. [2019-09-08 10:37:18,980 INFO L78 Accepts]: Start accepts. Automaton has 5555 states and 7873 transitions. Word has length 69 [2019-09-08 10:37:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:18,980 INFO L475 AbstractCegarLoop]: Abstraction has 5555 states and 7873 transitions. [2019-09-08 10:37:18,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5555 states and 7873 transitions. [2019-09-08 10:37:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:37:18,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:18,987 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] [2019-09-08 10:37:18,988 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:18,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:18,988 INFO L82 PathProgramCache]: Analyzing trace with hash 449186189, now seen corresponding path program 1 times [2019-09-08 10:37:18,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:18,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:18,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:19,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:19,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:19,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:19,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:19,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:19,175 INFO L87 Difference]: Start difference. First operand 5555 states and 7873 transitions. Second operand 6 states. [2019-09-08 10:37:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:20,265 INFO L93 Difference]: Finished difference Result 16005 states and 22901 transitions. [2019-09-08 10:37:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:20,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:37:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:20,334 INFO L225 Difference]: With dead ends: 16005 [2019-09-08 10:37:20,334 INFO L226 Difference]: Without dead ends: 10801 [2019-09-08 10:37:20,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:37:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10801 states. [2019-09-08 10:37:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10801 to 10737. [2019-09-08 10:37:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10737 states. [2019-09-08 10:37:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 15343 transitions. [2019-09-08 10:37:21,041 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 15343 transitions. Word has length 70 [2019-09-08 10:37:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:21,042 INFO L475 AbstractCegarLoop]: Abstraction has 10737 states and 15343 transitions. [2019-09-08 10:37:21,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 15343 transitions. [2019-09-08 10:37:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:37:21,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:21,050 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] [2019-09-08 10:37:21,051 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 178317883, now seen corresponding path program 1 times [2019-09-08 10:37:21,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:21,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:21,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:21,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:21,185 INFO L87 Difference]: Start difference. First operand 10737 states and 15343 transitions. Second operand 3 states. [2019-09-08 10:37:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:22,549 INFO L93 Difference]: Finished difference Result 25296 states and 36374 transitions. [2019-09-08 10:37:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:22,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 10:37:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:22,639 INFO L225 Difference]: With dead ends: 25296 [2019-09-08 10:37:22,639 INFO L226 Difference]: Without dead ends: 15819 [2019-09-08 10:37:22,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15819 states. [2019-09-08 10:37:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15819 to 15731. [2019-09-08 10:37:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15731 states. [2019-09-08 10:37:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15731 states to 15731 states and 22287 transitions. [2019-09-08 10:37:23,413 INFO L78 Accepts]: Start accepts. Automaton has 15731 states and 22287 transitions. Word has length 70 [2019-09-08 10:37:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:23,413 INFO L475 AbstractCegarLoop]: Abstraction has 15731 states and 22287 transitions. [2019-09-08 10:37:23,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 15731 states and 22287 transitions. [2019-09-08 10:37:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:37:23,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:23,426 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] [2019-09-08 10:37:23,426 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 769375619, now seen corresponding path program 1 times [2019-09-08 10:37:23,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:23,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:23,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:23,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:23,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:23,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:23,617 INFO L87 Difference]: Start difference. First operand 15731 states and 22287 transitions. Second operand 6 states. [2019-09-08 10:37:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:25,593 INFO L93 Difference]: Finished difference Result 48551 states and 68945 transitions. [2019-09-08 10:37:25,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:25,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:37:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:25,674 INFO L225 Difference]: With dead ends: 48551 [2019-09-08 10:37:25,674 INFO L226 Difference]: Without dead ends: 33315 [2019-09-08 10:37:25,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:37:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33315 states. [2019-09-08 10:37:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33315 to 33099. [2019-09-08 10:37:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33099 states. [2019-09-08 10:37:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33099 states to 33099 states and 46825 transitions. [2019-09-08 10:37:27,013 INFO L78 Accepts]: Start accepts. Automaton has 33099 states and 46825 transitions. Word has length 71 [2019-09-08 10:37:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:27,014 INFO L475 AbstractCegarLoop]: Abstraction has 33099 states and 46825 transitions. [2019-09-08 10:37:27,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33099 states and 46825 transitions. [2019-09-08 10:37:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:37:27,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:27,026 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] [2019-09-08 10:37:27,027 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -94739691, now seen corresponding path program 1 times [2019-09-08 10:37:27,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:27,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:27,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:27,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:27,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:27,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:27,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:37:27,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:37:27,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:37:27,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:37:27,167 INFO L87 Difference]: Start difference. First operand 33099 states and 46825 transitions. Second operand 7 states. [2019-09-08 10:37:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:34,078 INFO L93 Difference]: Finished difference Result 126232 states and 178443 transitions. [2019-09-08 10:37:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:37:34,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:37:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:34,325 INFO L225 Difference]: With dead ends: 126232 [2019-09-08 10:37:34,325 INFO L226 Difference]: Without dead ends: 109136 [2019-09-08 10:37:34,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:37:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109136 states. [2019-09-08 10:37:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109136 to 33127. [2019-09-08 10:37:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33127 states. [2019-09-08 10:37:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33127 states to 33127 states and 46861 transitions. [2019-09-08 10:37:37,606 INFO L78 Accepts]: Start accepts. Automaton has 33127 states and 46861 transitions. Word has length 72 [2019-09-08 10:37:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:37,606 INFO L475 AbstractCegarLoop]: Abstraction has 33127 states and 46861 transitions. [2019-09-08 10:37:37,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:37:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 33127 states and 46861 transitions. [2019-09-08 10:37:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:37:37,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:37,616 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] [2019-09-08 10:37:37,617 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash 446727203, now seen corresponding path program 1 times [2019-09-08 10:37:37,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:37,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:37,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:37,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:37:37,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:37:37,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:37:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:37:37,793 INFO L87 Difference]: Start difference. First operand 33127 states and 46861 transitions. Second operand 7 states. [2019-09-08 10:37:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:46,178 INFO L93 Difference]: Finished difference Result 140901 states and 199842 transitions. [2019-09-08 10:37:46,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:37:46,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:37:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:46,356 INFO L225 Difference]: With dead ends: 140901 [2019-09-08 10:37:46,357 INFO L226 Difference]: Without dead ends: 124486 [2019-09-08 10:37:46,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:37:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124486 states. [2019-09-08 10:37:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124486 to 33215. [2019-09-08 10:37:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33215 states. [2019-09-08 10:37:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33215 states to 33215 states and 46982 transitions. [2019-09-08 10:37:48,801 INFO L78 Accepts]: Start accepts. Automaton has 33215 states and 46982 transitions. Word has length 72 [2019-09-08 10:37:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:48,801 INFO L475 AbstractCegarLoop]: Abstraction has 33215 states and 46982 transitions. [2019-09-08 10:37:48,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:37:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 33215 states and 46982 transitions. [2019-09-08 10:37:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:37:48,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:48,812 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] [2019-09-08 10:37:48,812 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash -228168160, now seen corresponding path program 1 times [2019-09-08 10:37:48,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:48,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:48,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:48,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:37:48,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:37:48,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:37:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:37:48,934 INFO L87 Difference]: Start difference. First operand 33215 states and 46982 transitions. Second operand 7 states. [2019-09-08 10:38:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:01,793 INFO L93 Difference]: Finished difference Result 194807 states and 277969 transitions. [2019-09-08 10:38:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:38:01,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:38:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:02,051 INFO L225 Difference]: With dead ends: 194807 [2019-09-08 10:38:02,052 INFO L226 Difference]: Without dead ends: 180382 [2019-09-08 10:38:02,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:38:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180382 states. [2019-09-08 10:38:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180382 to 33283. [2019-09-08 10:38:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33283 states. [2019-09-08 10:38:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33283 states to 33283 states and 47070 transitions. [2019-09-08 10:38:05,095 INFO L78 Accepts]: Start accepts. Automaton has 33283 states and 47070 transitions. Word has length 72 [2019-09-08 10:38:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:05,095 INFO L475 AbstractCegarLoop]: Abstraction has 33283 states and 47070 transitions. [2019-09-08 10:38:05,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:38:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 33283 states and 47070 transitions. [2019-09-08 10:38:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:38:05,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:05,102 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] [2019-09-08 10:38:05,102 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1184969247, now seen corresponding path program 1 times [2019-09-08 10:38:05,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:05,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:05,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:05,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:05,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:05,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:05,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:38:05,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:38:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:38:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:38:05,224 INFO L87 Difference]: Start difference. First operand 33283 states and 47070 transitions. Second operand 7 states. [2019-09-08 10:38:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:18,756 INFO L93 Difference]: Finished difference Result 161297 states and 229456 transitions. [2019-09-08 10:38:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:38:18,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:38:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:18,934 INFO L225 Difference]: With dead ends: 161297 [2019-09-08 10:38:18,934 INFO L226 Difference]: Without dead ends: 144450 [2019-09-08 10:38:18,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:38:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144450 states. [2019-09-08 10:38:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144450 to 33446. [2019-09-08 10:38:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33446 states. [2019-09-08 10:38:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33446 states to 33446 states and 47285 transitions. [2019-09-08 10:38:22,361 INFO L78 Accepts]: Start accepts. Automaton has 33446 states and 47285 transitions. Word has length 72 [2019-09-08 10:38:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:22,362 INFO L475 AbstractCegarLoop]: Abstraction has 33446 states and 47285 transitions. [2019-09-08 10:38:22,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:38:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 33446 states and 47285 transitions. [2019-09-08 10:38:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:38:22,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:22,369 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] [2019-09-08 10:38:22,369 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:22,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash 961373533, now seen corresponding path program 1 times [2019-09-08 10:38:22,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:22,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:22,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:22,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:22,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:22,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:22,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:38:22,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:38:22,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:38:22,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:38:22,562 INFO L87 Difference]: Start difference. First operand 33446 states and 47285 transitions. Second operand 9 states. [2019-09-08 10:38:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:38,117 INFO L93 Difference]: Finished difference Result 168879 states and 243147 transitions. [2019-09-08 10:38:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:38:38,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:38:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:38,280 INFO L225 Difference]: With dead ends: 168879 [2019-09-08 10:38:38,280 INFO L226 Difference]: Without dead ends: 140994 [2019-09-08 10:38:38,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:38:38,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140994 states. [2019-09-08 10:38:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140994 to 33418. [2019-09-08 10:38:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33418 states. [2019-09-08 10:38:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33418 states to 33418 states and 47241 transitions. [2019-09-08 10:38:44,595 INFO L78 Accepts]: Start accepts. Automaton has 33418 states and 47241 transitions. Word has length 73 [2019-09-08 10:38:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:44,595 INFO L475 AbstractCegarLoop]: Abstraction has 33418 states and 47241 transitions. [2019-09-08 10:38:44,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:38:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 33418 states and 47241 transitions. [2019-09-08 10:38:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:38:44,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:44,602 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] [2019-09-08 10:38:44,603 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:44,603 INFO L82 PathProgramCache]: Analyzing trace with hash 6553349, now seen corresponding path program 1 times [2019-09-08 10:38:44,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:44,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:44,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:44,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:44,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:44,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:38:44,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:38:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:38:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:38:44,730 INFO L87 Difference]: Start difference. First operand 33418 states and 47241 transitions. Second operand 7 states. [2019-09-08 10:38:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:59,889 INFO L93 Difference]: Finished difference Result 141166 states and 200187 transitions. [2019-09-08 10:38:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:38:59,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-08 10:38:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:00,035 INFO L225 Difference]: With dead ends: 141166 [2019-09-08 10:39:00,036 INFO L226 Difference]: Without dead ends: 124751 [2019-09-08 10:39:00,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:39:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124751 states. [2019-09-08 10:39:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124751 to 33509. [2019-09-08 10:39:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33509 states. [2019-09-08 10:39:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33509 states to 33509 states and 47369 transitions. [2019-09-08 10:39:04,504 INFO L78 Accepts]: Start accepts. Automaton has 33509 states and 47369 transitions. Word has length 73 [2019-09-08 10:39:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:04,504 INFO L475 AbstractCegarLoop]: Abstraction has 33509 states and 47369 transitions. [2019-09-08 10:39:04,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:39:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 33509 states and 47369 transitions. [2019-09-08 10:39:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:39:04,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:04,512 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] [2019-09-08 10:39:04,512 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -88849401, now seen corresponding path program 1 times [2019-09-08 10:39:04,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:04,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:04,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:04,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:04,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:39:04,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:39:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:39:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:39:04,686 INFO L87 Difference]: Start difference. First operand 33509 states and 47369 transitions. Second operand 9 states. [2019-09-08 10:39:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:16,695 INFO L93 Difference]: Finished difference Result 113237 states and 162288 transitions. [2019-09-08 10:39:16,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:39:16,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:39:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:16,788 INFO L225 Difference]: With dead ends: 113237 [2019-09-08 10:39:16,788 INFO L226 Difference]: Without dead ends: 85384 [2019-09-08 10:39:16,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:39:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85384 states. [2019-09-08 10:39:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85384 to 33497. [2019-09-08 10:39:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33497 states. [2019-09-08 10:39:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33497 states to 33497 states and 47345 transitions. [2019-09-08 10:39:22,509 INFO L78 Accepts]: Start accepts. Automaton has 33497 states and 47345 transitions. Word has length 73 [2019-09-08 10:39:22,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:22,510 INFO L475 AbstractCegarLoop]: Abstraction has 33497 states and 47345 transitions. [2019-09-08 10:39:22,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:39:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33497 states and 47345 transitions. [2019-09-08 10:39:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:39:22,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:22,518 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] [2019-09-08 10:39:22,518 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1080005182, now seen corresponding path program 1 times [2019-09-08 10:39:22,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:22,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:22,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:22,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:22,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:39:22,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:39:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:39:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:39:22,689 INFO L87 Difference]: Start difference. First operand 33497 states and 47345 transitions. Second operand 9 states. [2019-09-08 10:39:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:41,985 INFO L93 Difference]: Finished difference Result 162627 states and 232497 transitions. [2019-09-08 10:39:41,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:39:41,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:39:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:42,143 INFO L225 Difference]: With dead ends: 162627 [2019-09-08 10:39:42,144 INFO L226 Difference]: Without dead ends: 134424 [2019-09-08 10:39:42,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:39:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134424 states. [2019-09-08 10:39:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134424 to 33311. [2019-09-08 10:39:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33311 states. [2019-09-08 10:39:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33311 states to 33311 states and 47098 transitions. [2019-09-08 10:39:47,198 INFO L78 Accepts]: Start accepts. Automaton has 33311 states and 47098 transitions. Word has length 73 [2019-09-08 10:39:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:47,198 INFO L475 AbstractCegarLoop]: Abstraction has 33311 states and 47098 transitions. [2019-09-08 10:39:47,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:39:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33311 states and 47098 transitions. [2019-09-08 10:39:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:39:47,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:47,206 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] [2019-09-08 10:39:47,207 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash 8591348, now seen corresponding path program 1 times [2019-09-08 10:39:47,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:47,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:47,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:39:47,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:39:47,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:39:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:39:47,378 INFO L87 Difference]: Start difference. First operand 33311 states and 47098 transitions. Second operand 8 states. [2019-09-08 10:40:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:05,560 INFO L93 Difference]: Finished difference Result 140022 states and 200822 transitions. [2019-09-08 10:40:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:40:05,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-09-08 10:40:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:05,687 INFO L225 Difference]: With dead ends: 140022 [2019-09-08 10:40:05,687 INFO L226 Difference]: Without dead ends: 110819 [2019-09-08 10:40:05,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:40:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110819 states. [2019-09-08 10:40:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110819 to 32719. [2019-09-08 10:40:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32719 states. [2019-09-08 10:40:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32719 states to 32719 states and 46326 transitions. [2019-09-08 10:40:10,446 INFO L78 Accepts]: Start accepts. Automaton has 32719 states and 46326 transitions. Word has length 73 [2019-09-08 10:40:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:10,446 INFO L475 AbstractCegarLoop]: Abstraction has 32719 states and 46326 transitions. [2019-09-08 10:40:10,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:40:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32719 states and 46326 transitions. [2019-09-08 10:40:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:40:10,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:10,452 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] [2019-09-08 10:40:10,453 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 591574109, now seen corresponding path program 1 times [2019-09-08 10:40:10,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:10,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:10,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:10,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:40:10,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:40:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:40:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:40:10,906 INFO L87 Difference]: Start difference. First operand 32719 states and 46326 transitions. Second operand 11 states. [2019-09-08 10:40:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:43,881 INFO L93 Difference]: Finished difference Result 199282 states and 285832 transitions. [2019-09-08 10:40:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:40:43,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-09-08 10:40:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:44,093 INFO L225 Difference]: With dead ends: 199282 [2019-09-08 10:40:44,093 INFO L226 Difference]: Without dead ends: 170924 [2019-09-08 10:40:44,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:40:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170924 states. [2019-09-08 10:40:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170924 to 32252. [2019-09-08 10:40:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32252 states. [2019-09-08 10:40:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32252 states to 32252 states and 45688 transitions. [2019-09-08 10:40:50,249 INFO L78 Accepts]: Start accepts. Automaton has 32252 states and 45688 transitions. Word has length 74 [2019-09-08 10:40:50,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:50,250 INFO L475 AbstractCegarLoop]: Abstraction has 32252 states and 45688 transitions. [2019-09-08 10:40:50,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:40:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 32252 states and 45688 transitions. [2019-09-08 10:40:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:40:50,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:50,255 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] [2019-09-08 10:40:50,255 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash 199562019, now seen corresponding path program 1 times [2019-09-08 10:40:50,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:50,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:50,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:50,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:40:50,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:40:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:40:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:40:50,777 INFO L87 Difference]: Start difference. First operand 32252 states and 45688 transitions. Second operand 12 states. [2019-09-08 10:41:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:32,109 INFO L93 Difference]: Finished difference Result 215606 states and 310054 transitions. [2019-09-08 10:41:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:41:32,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:41:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:32,335 INFO L225 Difference]: With dead ends: 215606 [2019-09-08 10:41:32,335 INFO L226 Difference]: Without dead ends: 187702 [2019-09-08 10:41:32,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:41:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187702 states. [2019-09-08 10:41:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187702 to 32175. [2019-09-08 10:41:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32175 states. [2019-09-08 10:41:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32175 states to 32175 states and 45577 transitions. [2019-09-08 10:41:39,367 INFO L78 Accepts]: Start accepts. Automaton has 32175 states and 45577 transitions. Word has length 74 [2019-09-08 10:41:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:39,367 INFO L475 AbstractCegarLoop]: Abstraction has 32175 states and 45577 transitions. [2019-09-08 10:41:39,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:41:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32175 states and 45577 transitions. [2019-09-08 10:41:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:41:39,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:39,373 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] [2019-09-08 10:41:39,373 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash 662330837, now seen corresponding path program 1 times [2019-09-08 10:41:39,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:39,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:39,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:39,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:39,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:41:39,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:41:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:41:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:41:39,852 INFO L87 Difference]: Start difference. First operand 32175 states and 45577 transitions. Second operand 12 states. [2019-09-08 10:41:41,053 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-09-08 10:42:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:23,197 INFO L93 Difference]: Finished difference Result 216513 states and 311085 transitions. [2019-09-08 10:42:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:42:23,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:42:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:23,413 INFO L225 Difference]: With dead ends: 216513 [2019-09-08 10:42:23,413 INFO L226 Difference]: Without dead ends: 188304 [2019-09-08 10:42:23,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:42:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188304 states. [2019-09-08 10:42:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188304 to 31779. [2019-09-08 10:42:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31779 states. [2019-09-08 10:42:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31779 states to 31779 states and 45078 transitions. [2019-09-08 10:42:31,157 INFO L78 Accepts]: Start accepts. Automaton has 31779 states and 45078 transitions. Word has length 74 [2019-09-08 10:42:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 31779 states and 45078 transitions. [2019-09-08 10:42:31,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:42:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31779 states and 45078 transitions. [2019-09-08 10:42:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:42:31,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:31,162 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] [2019-09-08 10:42:31,163 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1361298504, now seen corresponding path program 1 times [2019-09-08 10:42:31,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:31,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:31,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:42:31,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:42:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:42:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:42:31,259 INFO L87 Difference]: Start difference. First operand 31779 states and 45078 transitions. Second operand 3 states. [2019-09-08 10:42:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:39,647 INFO L93 Difference]: Finished difference Result 46341 states and 65694 transitions. [2019-09-08 10:42:39,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:42:39,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:42:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:39,678 INFO L225 Difference]: With dead ends: 46341 [2019-09-08 10:42:39,678 INFO L226 Difference]: Without dead ends: 31783 [2019-09-08 10:42:39,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:42:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31783 states. [2019-09-08 10:42:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31783 to 31779. [2019-09-08 10:42:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31779 states. [2019-09-08 10:42:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31779 states to 31779 states and 44562 transitions. [2019-09-08 10:42:46,402 INFO L78 Accepts]: Start accepts. Automaton has 31779 states and 44562 transitions. Word has length 75 [2019-09-08 10:42:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:46,403 INFO L475 AbstractCegarLoop]: Abstraction has 31779 states and 44562 transitions. [2019-09-08 10:42:46,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:42:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 31779 states and 44562 transitions. [2019-09-08 10:42:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:42:46,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:46,408 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] [2019-09-08 10:42:46,408 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 42269280, now seen corresponding path program 1 times [2019-09-08 10:42:46,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:46,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:46,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:46,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:42:46,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:42:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:42:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:42:46,498 INFO L87 Difference]: Start difference. First operand 31779 states and 44562 transitions. Second operand 3 states. [2019-09-08 10:42:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:57,256 INFO L93 Difference]: Finished difference Result 65701 states and 92517 transitions. [2019-09-08 10:42:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:42:57,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:42:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:57,310 INFO L225 Difference]: With dead ends: 65701 [2019-09-08 10:42:57,310 INFO L226 Difference]: Without dead ends: 47455 [2019-09-08 10:42:57,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:42:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47455 states. [2019-09-08 10:43:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47455 to 37083. [2019-09-08 10:43:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37083 states. [2019-09-08 10:43:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37083 states to 37083 states and 52268 transitions. [2019-09-08 10:43:06,802 INFO L78 Accepts]: Start accepts. Automaton has 37083 states and 52268 transitions. Word has length 76 [2019-09-08 10:43:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:06,802 INFO L475 AbstractCegarLoop]: Abstraction has 37083 states and 52268 transitions. [2019-09-08 10:43:06,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:43:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 37083 states and 52268 transitions. [2019-09-08 10:43:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:43:06,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:06,807 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] [2019-09-08 10:43:06,807 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:06,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2110038432, now seen corresponding path program 1 times [2019-09-08 10:43:06,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:06,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:06,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:43:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:43:06,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:43:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:43:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:43:06,888 INFO L87 Difference]: Start difference. First operand 37083 states and 52268 transitions. Second operand 3 states. [2019-09-08 10:43:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:17,690 INFO L93 Difference]: Finished difference Result 58170 states and 82109 transitions. [2019-09-08 10:43:17,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:43:17,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:43:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:17,732 INFO L225 Difference]: With dead ends: 58170 [2019-09-08 10:43:17,732 INFO L226 Difference]: Without dead ends: 40230 [2019-09-08 10:43:17,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:43:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40230 states. [2019-09-08 10:43:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40230 to 35853. [2019-09-08 10:43:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35853 states. [2019-09-08 10:43:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35853 states to 35853 states and 50609 transitions. [2019-09-08 10:43:26,834 INFO L78 Accepts]: Start accepts. Automaton has 35853 states and 50609 transitions. Word has length 76 [2019-09-08 10:43:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:26,834 INFO L475 AbstractCegarLoop]: Abstraction has 35853 states and 50609 transitions. [2019-09-08 10:43:26,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:43:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 35853 states and 50609 transitions. [2019-09-08 10:43:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:43:26,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:26,839 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] [2019-09-08 10:43:26,840 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1012060291, now seen corresponding path program 1 times [2019-09-08 10:43:26,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:26,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:43:27,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:27,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:43:27,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:43:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:43:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:43:27,021 INFO L87 Difference]: Start difference. First operand 35853 states and 50609 transitions. Second operand 9 states. [2019-09-08 10:44:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:04,520 INFO L93 Difference]: Finished difference Result 141642 states and 201811 transitions. [2019-09-08 10:44:04,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:44:04,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-08 10:44:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:04,662 INFO L225 Difference]: With dead ends: 141642 [2019-09-08 10:44:04,663 INFO L226 Difference]: Without dead ends: 124476 [2019-09-08 10:44:04,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:44:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124476 states. [2019-09-08 10:44:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124476 to 35781. [2019-09-08 10:44:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35781 states. [2019-09-08 10:44:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35781 states to 35781 states and 50511 transitions. [2019-09-08 10:44:14,759 INFO L78 Accepts]: Start accepts. Automaton has 35781 states and 50511 transitions. Word has length 77 [2019-09-08 10:44:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:14,759 INFO L475 AbstractCegarLoop]: Abstraction has 35781 states and 50511 transitions. [2019-09-08 10:44:14,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:44:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35781 states and 50511 transitions. [2019-09-08 10:44:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:44:14,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:14,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:14,766 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 386283916, now seen corresponding path program 1 times [2019-09-08 10:44:14,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:14,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:14,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:14,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:14,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:14,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:14,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:14,863 INFO L87 Difference]: Start difference. First operand 35781 states and 50511 transitions. Second operand 3 states. [2019-09-08 10:44:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:24,803 INFO L93 Difference]: Finished difference Result 55624 states and 78460 transitions. [2019-09-08 10:44:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:24,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:44:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:24,841 INFO L225 Difference]: With dead ends: 55624 [2019-09-08 10:44:24,841 INFO L226 Difference]: Without dead ends: 35785 [2019-09-08 10:44:24,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35785 states. [2019-09-08 10:44:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35785 to 35781. [2019-09-08 10:44:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35781 states. [2019-09-08 10:44:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35781 states to 35781 states and 49988 transitions. [2019-09-08 10:44:34,392 INFO L78 Accepts]: Start accepts. Automaton has 35781 states and 49988 transitions. Word has length 78 [2019-09-08 10:44:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:34,392 INFO L475 AbstractCegarLoop]: Abstraction has 35781 states and 49988 transitions. [2019-09-08 10:44:34,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35781 states and 49988 transitions. [2019-09-08 10:44:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:44:34,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:34,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:34,400 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1282642039, now seen corresponding path program 1 times [2019-09-08 10:44:34,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:34,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:34,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:34,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:34,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:34,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:34,468 INFO L87 Difference]: Start difference. First operand 35781 states and 49988 transitions. Second operand 3 states. [2019-09-08 10:44:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:49,354 INFO L93 Difference]: Finished difference Result 75353 states and 105805 transitions. [2019-09-08 10:44:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:49,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 10:44:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:49,412 INFO L225 Difference]: With dead ends: 75353 [2019-09-08 10:44:49,412 INFO L226 Difference]: Without dead ends: 54806 [2019-09-08 10:44:49,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54806 states. [2019-09-08 10:45:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54806 to 35644. [2019-09-08 10:45:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35644 states. [2019-09-08 10:45:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35644 states to 35644 states and 49700 transitions. [2019-09-08 10:45:00,704 INFO L78 Accepts]: Start accepts. Automaton has 35644 states and 49700 transitions. Word has length 80 [2019-09-08 10:45:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:00,704 INFO L475 AbstractCegarLoop]: Abstraction has 35644 states and 49700 transitions. [2019-09-08 10:45:00,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 35644 states and 49700 transitions. [2019-09-08 10:45:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:45:00,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:00,714 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] [2019-09-08 10:45:00,714 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1433154749, now seen corresponding path program 1 times [2019-09-08 10:45:00,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:00,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:00,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:00,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:01,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:01,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:45:01,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:45:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:45:01,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:45:01,477 INFO L87 Difference]: Start difference. First operand 35644 states and 49700 transitions. Second operand 17 states. [2019-09-08 10:45:02,093 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 10:45:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:24,161 INFO L93 Difference]: Finished difference Result 64745 states and 90731 transitions. [2019-09-08 10:45:24,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 10:45:24,162 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2019-09-08 10:45:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:24,222 INFO L225 Difference]: With dead ends: 64745 [2019-09-08 10:45:24,222 INFO L226 Difference]: Without dead ends: 57661 [2019-09-08 10:45:24,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:45:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57661 states. [2019-09-08 10:45:35,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57661 to 35580. [2019-09-08 10:45:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35580 states. [2019-09-08 10:45:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35580 states to 35580 states and 49620 transitions. [2019-09-08 10:45:35,754 INFO L78 Accepts]: Start accepts. Automaton has 35580 states and 49620 transitions. Word has length 80 [2019-09-08 10:45:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:35,754 INFO L475 AbstractCegarLoop]: Abstraction has 35580 states and 49620 transitions. [2019-09-08 10:45:35,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:45:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35580 states and 49620 transitions. [2019-09-08 10:45:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:45:35,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:35,761 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] [2019-09-08 10:45:35,762 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:35,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:35,762 INFO L82 PathProgramCache]: Analyzing trace with hash 81860216, now seen corresponding path program 1 times [2019-09-08 10:45:35,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:35,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:35,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:35,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:35,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:36,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:36,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:45:36,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:45:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:45:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:45:36,506 INFO L87 Difference]: Start difference. First operand 35580 states and 49620 transitions. Second operand 16 states. [2019-09-08 10:45:36,940 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-09-08 10:46:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:20,868 INFO L93 Difference]: Finished difference Result 130624 states and 184357 transitions. [2019-09-08 10:46:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:46:20,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-08 10:46:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:21,034 INFO L225 Difference]: With dead ends: 130624 [2019-09-08 10:46:21,034 INFO L226 Difference]: Without dead ends: 123600 [2019-09-08 10:46:21,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:46:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123600 states. [2019-09-08 10:46:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123600 to 35574. [2019-09-08 10:46:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35574 states. [2019-09-08 10:46:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35574 states to 35574 states and 49611 transitions. [2019-09-08 10:46:33,795 INFO L78 Accepts]: Start accepts. Automaton has 35574 states and 49611 transitions. Word has length 81 [2019-09-08 10:46:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:33,796 INFO L475 AbstractCegarLoop]: Abstraction has 35574 states and 49611 transitions. [2019-09-08 10:46:33,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:46:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 35574 states and 49611 transitions. [2019-09-08 10:46:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 10:46:33,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:33,811 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] [2019-09-08 10:46:33,812 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:33,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2040450539, now seen corresponding path program 1 times [2019-09-08 10:46:33,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:33,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:33,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:33,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:33,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:33,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:46:33,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:46:33,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:46:33,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:46:33,939 INFO L87 Difference]: Start difference. First operand 35574 states and 49611 transitions. Second operand 7 states. [2019-09-08 10:48:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:06,801 INFO L93 Difference]: Finished difference Result 290292 states and 408378 transitions. [2019-09-08 10:48:06,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:48:06,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 10:48:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:07,167 INFO L225 Difference]: With dead ends: 290292 [2019-09-08 10:48:07,167 INFO L226 Difference]: Without dead ends: 257280 [2019-09-08 10:48:07,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:48:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257280 states. [2019-09-08 10:48:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257280 to 134304. [2019-09-08 10:48:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134304 states. [2019-09-08 10:48:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134304 states to 134304 states and 186341 transitions. [2019-09-08 10:48:58,089 INFO L78 Accepts]: Start accepts. Automaton has 134304 states and 186341 transitions. Word has length 90 [2019-09-08 10:48:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:58,089 INFO L475 AbstractCegarLoop]: Abstraction has 134304 states and 186341 transitions. [2019-09-08 10:48:58,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:48:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 134304 states and 186341 transitions. [2019-09-08 10:48:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 10:48:58,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:58,117 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] [2019-09-08 10:48:58,117 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1916809887, now seen corresponding path program 1 times [2019-09-08 10:48:58,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:58,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:58,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:58,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:58,247 INFO L87 Difference]: Start difference. First operand 134304 states and 186341 transitions. Second operand 6 states. [2019-09-08 10:49:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:57,121 INFO L93 Difference]: Finished difference Result 204208 states and 281144 transitions. [2019-09-08 10:49:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:49:57,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 10:49:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:57,299 INFO L225 Difference]: With dead ends: 204208 [2019-09-08 10:49:57,299 INFO L226 Difference]: Without dead ends: 155896 [2019-09-08 10:49:57,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:49:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155896 states.