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.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:55:55,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:55:55,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:55:55,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:55:55,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:55:55,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:55:55,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:55:55,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:55:55,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:55:55,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:55:55,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:55:55,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:55:55,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:55:55,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:55:55,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:55:55,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:55:55,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:55:55,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:55:55,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:55:55,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:55:55,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:55:55,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:55:55,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:55:55,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:55:55,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:55:55,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:55:55,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:55:55,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:55:55,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:55:55,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:55:55,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:55:55,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:55:55,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:55:55,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:55:55,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:55:55,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:55:55,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:55:55,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:55:55,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:55:55,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:55:55,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:55:55,233 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-10-02 14:55:55,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:55:55,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:55:55,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:55:55,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:55:55,255 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:55:55,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:55:55,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:55:55,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:55:55,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:55:55,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:55:55,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:55:55,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:55:55,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:55:55,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:55:55,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:55:55,257 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:55:55,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:55:55,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:55:55,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:55:55,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:55:55,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:55:55,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:55:55,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:55:55,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:55:55,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:55:55,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:55:55,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:55:55,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:55:55,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:55:55,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:55:55,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:55:55,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:55:55,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:55:55,324 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:55:55,325 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.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-02 14:55:55,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5495720ac/7737e398debb4386825b5a0c37e254a2/FLAG166cb1aee [2019-10-02 14:55:55,926 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:55:55,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-02 14:55:55,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5495720ac/7737e398debb4386825b5a0c37e254a2/FLAG166cb1aee [2019-10-02 14:55:56,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5495720ac/7737e398debb4386825b5a0c37e254a2 [2019-10-02 14:55:56,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:55:56,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:55:56,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:55:56,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:55:56,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:55:56,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4db0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56, skipping insertion in model container [2019-10-02 14:55:56,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,234 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:55:56,295 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:55:56,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:55:56,679 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:55:56,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:55:56,792 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:55:56,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56 WrapperNode [2019-10-02 14:55:56,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:55:56,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:55:56,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:55:56,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:55:56,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (1/1) ... [2019-10-02 14:55:56,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:55:56,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:55:56,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:55:56,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:55:56,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (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-10-02 14:55:56,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:55:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:55:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:55:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:55:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:55:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:55:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:55:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:55:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:55:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:55:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:55:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:55:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:55:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:55:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:55:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:55:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:55:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:55:57,736 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:55:57,736 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:55:57,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:55:57 BoogieIcfgContainer [2019-10-02 14:55:57,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:55:57,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:55:57,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:55:57,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:55:57,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:55:56" (1/3) ... [2019-10-02 14:55:57,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f095431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:55:57, skipping insertion in model container [2019-10-02 14:55:57,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:56" (2/3) ... [2019-10-02 14:55:57,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f095431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:55:57, skipping insertion in model container [2019-10-02 14:55:57,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:55:57" (3/3) ... [2019-10-02 14:55:57,747 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-02 14:55:57,756 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:55:57,764 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:55:57,782 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:55:57,814 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:55:57,815 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:55:57,815 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:55:57,815 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:55:57,816 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:55:57,816 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:55:57,816 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:55:57,816 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:55:57,816 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:55:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-10-02 14:55:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 14:55:57,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:57,847 INFO L411 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] [2019-10-02 14:55:57,850 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash 273290580, now seen corresponding path program 1 times [2019-10-02 14:55:57,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:57,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:57,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:57,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:57,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:58,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:58,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:55:58,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:55:58,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:55:58,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:55:58,410 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 6 states. [2019-10-02 14:55:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:58,897 INFO L93 Difference]: Finished difference Result 731 states and 1151 transitions. [2019-10-02 14:55:58,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:55:58,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-02 14:55:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:58,929 INFO L225 Difference]: With dead ends: 731 [2019-10-02 14:55:58,929 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 14:55:58,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:55:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 14:55:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 425. [2019-10-02 14:55:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-02 14:55:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2019-10-02 14:55:59,074 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 53 [2019-10-02 14:55:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:59,076 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2019-10-02 14:55:59,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:55:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2019-10-02 14:55:59,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:55:59,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:59,080 INFO L411 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] [2019-10-02 14:55:59,080 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1842914518, now seen corresponding path program 1 times [2019-10-02 14:55:59,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:59,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:59,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:59,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:59,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:59,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:59,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:55:59,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:55:59,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:55:59,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:55:59,220 INFO L87 Difference]: Start difference. First operand 425 states and 641 transitions. Second operand 3 states. [2019-10-02 14:55:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:59,281 INFO L93 Difference]: Finished difference Result 1108 states and 1693 transitions. [2019-10-02 14:55:59,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:55:59,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-02 14:55:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:59,286 INFO L225 Difference]: With dead ends: 1108 [2019-10-02 14:55:59,286 INFO L226 Difference]: Without dead ends: 751 [2019-10-02 14:55:59,289 INFO L640 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-10-02 14:55:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-10-02 14:55:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2019-10-02 14:55:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-02 14:55:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1125 transitions. [2019-10-02 14:55:59,334 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1125 transitions. Word has length 56 [2019-10-02 14:55:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:59,335 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1125 transitions. [2019-10-02 14:55:59,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:55:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1125 transitions. [2019-10-02 14:55:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:55:59,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:59,349 INFO L411 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] [2019-10-02 14:55:59,349 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash -315457832, now seen corresponding path program 1 times [2019-10-02 14:55:59,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:59,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:59,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:59,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:59,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:59,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:59,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:55:59,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:55:59,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:55:59,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:55:59,477 INFO L87 Difference]: Start difference. First operand 749 states and 1125 transitions. Second operand 3 states. [2019-10-02 14:55:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:59,571 INFO L93 Difference]: Finished difference Result 2012 states and 3038 transitions. [2019-10-02 14:55:59,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:55:59,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-02 14:55:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:59,580 INFO L225 Difference]: With dead ends: 2012 [2019-10-02 14:55:59,581 INFO L226 Difference]: Without dead ends: 1339 [2019-10-02 14:55:59,583 INFO L640 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-10-02 14:55:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-10-02 14:55:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-10-02 14:55:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-02 14:55:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1974 transitions. [2019-10-02 14:55:59,663 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1974 transitions. Word has length 56 [2019-10-02 14:55:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:59,664 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1974 transitions. [2019-10-02 14:55:59,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:55:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1974 transitions. [2019-10-02 14:55:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:55:59,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:59,666 INFO L411 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] [2019-10-02 14:55:59,666 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:59,667 INFO L82 PathProgramCache]: Analyzing trace with hash -622080838, now seen corresponding path program 1 times [2019-10-02 14:55:59,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:59,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:59,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:59,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:55:59,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:55:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:55:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:55:59,841 INFO L87 Difference]: Start difference. First operand 1337 states and 1974 transitions. Second operand 10 states. [2019-10-02 14:56:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:01,695 INFO L93 Difference]: Finished difference Result 7876 states and 11683 transitions. [2019-10-02 14:56:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:56:01,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-10-02 14:56:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:01,731 INFO L225 Difference]: With dead ends: 7876 [2019-10-02 14:56:01,731 INFO L226 Difference]: Without dead ends: 7375 [2019-10-02 14:56:01,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:56:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2019-10-02 14:56:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 1362. [2019-10-02 14:56:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-10-02 14:56:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2006 transitions. [2019-10-02 14:56:01,896 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2006 transitions. Word has length 57 [2019-10-02 14:56:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:01,897 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2006 transitions. [2019-10-02 14:56:01,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2006 transitions. [2019-10-02 14:56:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:01,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:01,899 INFO L411 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] [2019-10-02 14:56:01,899 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash -993204644, now seen corresponding path program 1 times [2019-10-02 14:56:01,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:01,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:01,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:01,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:02,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:02,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:02,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:02,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:02,027 INFO L87 Difference]: Start difference. First operand 1362 states and 2006 transitions. Second operand 9 states. [2019-10-02 14:56:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:04,056 INFO L93 Difference]: Finished difference Result 8646 states and 12825 transitions. [2019-10-02 14:56:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:56:04,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 14:56:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:04,094 INFO L225 Difference]: With dead ends: 8646 [2019-10-02 14:56:04,095 INFO L226 Difference]: Without dead ends: 7508 [2019-10-02 14:56:04,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:56:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2019-10-02 14:56:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 1401. [2019-10-02 14:56:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-02 14:56:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2057 transitions. [2019-10-02 14:56:04,280 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2057 transitions. Word has length 58 [2019-10-02 14:56:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:04,280 INFO L475 AbstractCegarLoop]: Abstraction has 1401 states and 2057 transitions. [2019-10-02 14:56:04,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2057 transitions. [2019-10-02 14:56:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:04,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:04,282 INFO L411 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] [2019-10-02 14:56:04,282 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1499714113, now seen corresponding path program 1 times [2019-10-02 14:56:04,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:04,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:04,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:04,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:04,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:04,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:56:04,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:56:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:56:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:04,373 INFO L87 Difference]: Start difference. First operand 1401 states and 2057 transitions. Second operand 7 states. [2019-10-02 14:56:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:05,360 INFO L93 Difference]: Finished difference Result 5866 states and 8795 transitions. [2019-10-02 14:56:05,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:05,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-02 14:56:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:05,386 INFO L225 Difference]: With dead ends: 5866 [2019-10-02 14:56:05,386 INFO L226 Difference]: Without dead ends: 5365 [2019-10-02 14:56:05,389 INFO L640 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-10-02 14:56:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-10-02 14:56:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 1382. [2019-10-02 14:56:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-02 14:56:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2033 transitions. [2019-10-02 14:56:05,605 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2033 transitions. Word has length 58 [2019-10-02 14:56:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:05,607 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 2033 transitions. [2019-10-02 14:56:05,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:56:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2033 transitions. [2019-10-02 14:56:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:05,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:05,609 INFO L411 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] [2019-10-02 14:56:05,609 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1924616750, now seen corresponding path program 1 times [2019-10-02 14:56:05,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:05,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:05,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:05,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:05,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:05,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:56:05,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:56:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:56:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:05,741 INFO L87 Difference]: Start difference. First operand 1382 states and 2033 transitions. Second operand 7 states. [2019-10-02 14:56:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:06,585 INFO L93 Difference]: Finished difference Result 5664 states and 8377 transitions. [2019-10-02 14:56:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:06,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-02 14:56:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:06,607 INFO L225 Difference]: With dead ends: 5664 [2019-10-02 14:56:06,607 INFO L226 Difference]: Without dead ends: 4526 [2019-10-02 14:56:06,611 INFO L640 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-10-02 14:56:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-10-02 14:56:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 1363. [2019-10-02 14:56:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-02 14:56:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2006 transitions. [2019-10-02 14:56:06,826 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2006 transitions. Word has length 59 [2019-10-02 14:56:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:06,826 INFO L475 AbstractCegarLoop]: Abstraction has 1363 states and 2006 transitions. [2019-10-02 14:56:06,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:56:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2006 transitions. [2019-10-02 14:56:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:06,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:06,828 INFO L411 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] [2019-10-02 14:56:06,828 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:06,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash -157395530, now seen corresponding path program 1 times [2019-10-02 14:56:06,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:06,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:06,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:06,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:06,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:06,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:06,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:06,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:06,947 INFO L87 Difference]: Start difference. First operand 1363 states and 2006 transitions. Second operand 9 states. [2019-10-02 14:56:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:08,208 INFO L93 Difference]: Finished difference Result 7072 states and 10472 transitions. [2019-10-02 14:56:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:56:08,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-02 14:56:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:08,222 INFO L225 Difference]: With dead ends: 7072 [2019-10-02 14:56:08,222 INFO L226 Difference]: Without dead ends: 5799 [2019-10-02 14:56:08,227 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:56:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5799 states. [2019-10-02 14:56:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5799 to 3842. [2019-10-02 14:56:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2019-10-02 14:56:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5718 transitions. [2019-10-02 14:56:08,771 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5718 transitions. Word has length 59 [2019-10-02 14:56:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:08,771 INFO L475 AbstractCegarLoop]: Abstraction has 3842 states and 5718 transitions. [2019-10-02 14:56:08,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5718 transitions. [2019-10-02 14:56:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:08,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:08,773 INFO L411 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] [2019-10-02 14:56:08,774 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2127126793, now seen corresponding path program 1 times [2019-10-02 14:56:08,774 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:08,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:08,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:08,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:08,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:08,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:08,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:08,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:08,909 INFO L87 Difference]: Start difference. First operand 3842 states and 5718 transitions. Second operand 9 states. [2019-10-02 14:56:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:11,531 INFO L93 Difference]: Finished difference Result 20312 states and 30202 transitions. [2019-10-02 14:56:11,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:56:11,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-02 14:56:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:11,571 INFO L225 Difference]: With dead ends: 20312 [2019-10-02 14:56:11,571 INFO L226 Difference]: Without dead ends: 16960 [2019-10-02 14:56:11,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:56:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-10-02 14:56:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 11727. [2019-10-02 14:56:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-10-02 14:56:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 17416 transitions. [2019-10-02 14:56:12,836 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 17416 transitions. Word has length 59 [2019-10-02 14:56:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:12,836 INFO L475 AbstractCegarLoop]: Abstraction has 11727 states and 17416 transitions. [2019-10-02 14:56:12,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 17416 transitions. [2019-10-02 14:56:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:12,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:12,840 INFO L411 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] [2019-10-02 14:56:12,841 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1033600256, now seen corresponding path program 1 times [2019-10-02 14:56:12,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:12,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:12,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:12,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:13,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:13,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:56:13,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:56:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:56:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:56:13,042 INFO L87 Difference]: Start difference. First operand 11727 states and 17416 transitions. Second operand 6 states. [2019-10-02 14:56:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:14,670 INFO L93 Difference]: Finished difference Result 23775 states and 35310 transitions. [2019-10-02 14:56:14,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:14,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-02 14:56:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:14,701 INFO L225 Difference]: With dead ends: 23775 [2019-10-02 14:56:14,701 INFO L226 Difference]: Without dead ends: 12940 [2019-10-02 14:56:14,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:56:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2019-10-02 14:56:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 8396. [2019-10-02 14:56:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-10-02 14:56:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 12355 transitions. [2019-10-02 14:56:16,293 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 12355 transitions. Word has length 60 [2019-10-02 14:56:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:16,293 INFO L475 AbstractCegarLoop]: Abstraction has 8396 states and 12355 transitions. [2019-10-02 14:56:16,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:56:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 12355 transitions. [2019-10-02 14:56:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:16,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:16,297 INFO L411 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] [2019-10-02 14:56:16,297 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash -976844717, now seen corresponding path program 1 times [2019-10-02 14:56:16,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:16,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:16,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:16,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:16,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:16,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:56:16,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:56:16,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:56:16,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:56:16,375 INFO L87 Difference]: Start difference. First operand 8396 states and 12355 transitions. Second operand 6 states. [2019-10-02 14:56:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:17,792 INFO L93 Difference]: Finished difference Result 20131 states and 29816 transitions. [2019-10-02 14:56:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:17,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-02 14:56:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:17,815 INFO L225 Difference]: With dead ends: 20131 [2019-10-02 14:56:17,815 INFO L226 Difference]: Without dead ends: 12331 [2019-10-02 14:56:17,830 INFO L640 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-10-02 14:56:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12331 states. [2019-10-02 14:56:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12331 to 7655. [2019-10-02 14:56:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-02 14:56:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11188 transitions. [2019-10-02 14:56:18,749 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11188 transitions. Word has length 60 [2019-10-02 14:56:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:18,749 INFO L475 AbstractCegarLoop]: Abstraction has 7655 states and 11188 transitions. [2019-10-02 14:56:18,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:56:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11188 transitions. [2019-10-02 14:56:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:18,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:18,752 INFO L411 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] [2019-10-02 14:56:18,753 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1274910523, now seen corresponding path program 1 times [2019-10-02 14:56:18,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:18,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:56:18,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:56:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:56:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:56:18,815 INFO L87 Difference]: Start difference. First operand 7655 states and 11188 transitions. Second operand 5 states. [2019-10-02 14:56:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:20,232 INFO L93 Difference]: Finished difference Result 18506 states and 26953 transitions. [2019-10-02 14:56:20,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:20,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-02 14:56:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:20,246 INFO L225 Difference]: With dead ends: 18506 [2019-10-02 14:56:20,246 INFO L226 Difference]: Without dead ends: 10932 [2019-10-02 14:56:20,261 INFO L640 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-10-02 14:56:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2019-10-02 14:56:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 7655. [2019-10-02 14:56:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-02 14:56:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11084 transitions. [2019-10-02 14:56:21,468 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11084 transitions. Word has length 60 [2019-10-02 14:56:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:21,468 INFO L475 AbstractCegarLoop]: Abstraction has 7655 states and 11084 transitions. [2019-10-02 14:56:21,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:56:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11084 transitions. [2019-10-02 14:56:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:56:21,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:21,470 INFO L411 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] [2019-10-02 14:56:21,470 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1286220475, now seen corresponding path program 1 times [2019-10-02 14:56:21,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:21,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:21,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:21,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:21,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:56:21,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:56:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:56:21,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:56:21,544 INFO L87 Difference]: Start difference. First operand 7655 states and 11084 transitions. Second operand 5 states. [2019-10-02 14:56:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:23,613 INFO L93 Difference]: Finished difference Result 19872 states and 28987 transitions. [2019-10-02 14:56:23,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:23,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-02 14:56:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:23,635 INFO L225 Difference]: With dead ends: 19872 [2019-10-02 14:56:23,635 INFO L226 Difference]: Without dead ends: 15928 [2019-10-02 14:56:23,643 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15928 states. [2019-10-02 14:56:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15928 to 9395. [2019-10-02 14:56:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9395 states. [2019-10-02 14:56:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9395 states to 9395 states and 13659 transitions. [2019-10-02 14:56:24,905 INFO L78 Accepts]: Start accepts. Automaton has 9395 states and 13659 transitions. Word has length 61 [2019-10-02 14:56:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:24,905 INFO L475 AbstractCegarLoop]: Abstraction has 9395 states and 13659 transitions. [2019-10-02 14:56:24,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:56:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 9395 states and 13659 transitions. [2019-10-02 14:56:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:56:24,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:24,907 INFO L411 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] [2019-10-02 14:56:24,908 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash 740645981, now seen corresponding path program 1 times [2019-10-02 14:56:24,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:24,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:24,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:24,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:24,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:24,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:24,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:56:24,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:56:24,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:56:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:56:24,984 INFO L87 Difference]: Start difference. First operand 9395 states and 13659 transitions. Second operand 5 states. [2019-10-02 14:56:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:27,349 INFO L93 Difference]: Finished difference Result 21359 states and 31168 transitions. [2019-10-02 14:56:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:27,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-02 14:56:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:27,373 INFO L225 Difference]: With dead ends: 21359 [2019-10-02 14:56:27,373 INFO L226 Difference]: Without dead ends: 17415 [2019-10-02 14:56:27,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2019-10-02 14:56:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 11338. [2019-10-02 14:56:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-10-02 14:56:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 16529 transitions. [2019-10-02 14:56:28,751 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 16529 transitions. Word has length 61 [2019-10-02 14:56:28,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:28,752 INFO L475 AbstractCegarLoop]: Abstraction has 11338 states and 16529 transitions. [2019-10-02 14:56:28,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:56:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 16529 transitions. [2019-10-02 14:56:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 14:56:28,755 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:28,755 INFO L411 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] [2019-10-02 14:56:28,755 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1147863087, now seen corresponding path program 1 times [2019-10-02 14:56:28,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:28,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:28,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:28,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:28,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:28,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:28,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:28,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:28,800 INFO L87 Difference]: Start difference. First operand 11338 states and 16529 transitions. Second operand 3 states. [2019-10-02 14:56:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:31,133 INFO L93 Difference]: Finished difference Result 27635 states and 40262 transitions. [2019-10-02 14:56:31,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:31,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-02 14:56:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:31,153 INFO L225 Difference]: With dead ends: 27635 [2019-10-02 14:56:31,154 INFO L226 Difference]: Without dead ends: 16793 [2019-10-02 14:56:31,170 INFO L640 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-10-02 14:56:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-10-02 14:56:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 13747. [2019-10-02 14:56:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13747 states. [2019-10-02 14:56:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13747 states to 13747 states and 19699 transitions. [2019-10-02 14:56:33,172 INFO L78 Accepts]: Start accepts. Automaton has 13747 states and 19699 transitions. Word has length 64 [2019-10-02 14:56:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:33,172 INFO L475 AbstractCegarLoop]: Abstraction has 13747 states and 19699 transitions. [2019-10-02 14:56:33,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 13747 states and 19699 transitions. [2019-10-02 14:56:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 14:56:33,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:33,176 INFO L411 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] [2019-10-02 14:56:33,176 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2093601519, now seen corresponding path program 1 times [2019-10-02 14:56:33,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:33,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:33,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:33,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:33,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:56:33,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:56:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:56:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:33,250 INFO L87 Difference]: Start difference. First operand 13747 states and 19699 transitions. Second operand 7 states. [2019-10-02 14:56:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:42,788 INFO L93 Difference]: Finished difference Result 62658 states and 89107 transitions. [2019-10-02 14:56:42,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:56:42,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-10-02 14:56:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:42,857 INFO L225 Difference]: With dead ends: 62658 [2019-10-02 14:56:42,857 INFO L226 Difference]: Without dead ends: 56579 [2019-10-02 14:56:42,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:56:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56579 states. [2019-10-02 14:56:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56579 to 13825. [2019-10-02 14:56:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-10-02 14:56:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19799 transitions. [2019-10-02 14:56:45,318 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19799 transitions. Word has length 64 [2019-10-02 14:56:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:45,318 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 19799 transitions. [2019-10-02 14:56:45,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:56:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19799 transitions. [2019-10-02 14:56:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:56:45,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:45,323 INFO L411 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] [2019-10-02 14:56:45,323 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:45,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1818867674, now seen corresponding path program 1 times [2019-10-02 14:56:45,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:45,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:45,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:45,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:45,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:45,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:45,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:45,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:45,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:45,543 INFO L87 Difference]: Start difference. First operand 13825 states and 19799 transitions. Second operand 10 states. [2019-10-02 14:56:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:54,000 INFO L93 Difference]: Finished difference Result 48961 states and 69705 transitions. [2019-10-02 14:56:54,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:56:54,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-02 14:56:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:54,043 INFO L225 Difference]: With dead ends: 48961 [2019-10-02 14:56:54,044 INFO L226 Difference]: Without dead ends: 36159 [2019-10-02 14:56:54,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:56:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36159 states. [2019-10-02 14:56:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36159 to 13825. [2019-10-02 14:56:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-10-02 14:56:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19793 transitions. [2019-10-02 14:56:56,456 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19793 transitions. Word has length 66 [2019-10-02 14:56:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:56,456 INFO L475 AbstractCegarLoop]: Abstraction has 13825 states and 19793 transitions. [2019-10-02 14:56:56,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19793 transitions. [2019-10-02 14:56:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:56:56,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:56,460 INFO L411 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] [2019-10-02 14:56:56,460 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1934158108, now seen corresponding path program 1 times [2019-10-02 14:56:56,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:56,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:56,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:56,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:56,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:56,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:56,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:56,630 INFO L87 Difference]: Start difference. First operand 13825 states and 19793 transitions. Second operand 10 states. [2019-10-02 14:57:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:04,825 INFO L93 Difference]: Finished difference Result 50667 states and 72233 transitions. [2019-10-02 14:57:04,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:57:04,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-02 14:57:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:04,866 INFO L225 Difference]: With dead ends: 50667 [2019-10-02 14:57:04,866 INFO L226 Difference]: Without dead ends: 37943 [2019-10-02 14:57:04,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:57:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37943 states. [2019-10-02 14:57:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37943 to 13608. [2019-10-02 14:57:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13608 states. [2019-10-02 14:57:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13608 states to 13608 states and 19479 transitions. [2019-10-02 14:57:07,348 INFO L78 Accepts]: Start accepts. Automaton has 13608 states and 19479 transitions. Word has length 66 [2019-10-02 14:57:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:07,348 INFO L475 AbstractCegarLoop]: Abstraction has 13608 states and 19479 transitions. [2019-10-02 14:57:07,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:57:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13608 states and 19479 transitions. [2019-10-02 14:57:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:57:07,351 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:07,351 INFO L411 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] [2019-10-02 14:57:07,352 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 810899746, now seen corresponding path program 1 times [2019-10-02 14:57:07,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:07,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:07,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:07,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:57:07,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:57:07,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:57:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:57:07,557 INFO L87 Difference]: Start difference. First operand 13608 states and 19479 transitions. Second operand 10 states. [2019-10-02 14:57:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:16,679 INFO L93 Difference]: Finished difference Result 48040 states and 68466 transitions. [2019-10-02 14:57:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:57:16,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-02 14:57:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:16,722 INFO L225 Difference]: With dead ends: 48040 [2019-10-02 14:57:16,722 INFO L226 Difference]: Without dead ends: 35496 [2019-10-02 14:57:16,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:57:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35496 states. [2019-10-02 14:57:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35496 to 13474. [2019-10-02 14:57:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13474 states. [2019-10-02 14:57:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13474 states to 13474 states and 19278 transitions. [2019-10-02 14:57:19,368 INFO L78 Accepts]: Start accepts. Automaton has 13474 states and 19278 transitions. Word has length 66 [2019-10-02 14:57:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:19,369 INFO L475 AbstractCegarLoop]: Abstraction has 13474 states and 19278 transitions. [2019-10-02 14:57:19,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:57:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 13474 states and 19278 transitions. [2019-10-02 14:57:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:57:19,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:19,372 INFO L411 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] [2019-10-02 14:57:19,372 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1139713951, now seen corresponding path program 1 times [2019-10-02 14:57:19,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:19,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:19,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:19,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:19,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:19,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:19,436 INFO L87 Difference]: Start difference. First operand 13474 states and 19278 transitions. Second operand 3 states. [2019-10-02 14:57:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:22,370 INFO L93 Difference]: Finished difference Result 19562 states and 27913 transitions. [2019-10-02 14:57:22,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:22,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-02 14:57:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:22,386 INFO L225 Difference]: With dead ends: 19562 [2019-10-02 14:57:22,386 INFO L226 Difference]: Without dead ends: 13476 [2019-10-02 14:57:22,395 INFO L640 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-10-02 14:57:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13476 states. [2019-10-02 14:57:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13476 to 13474. [2019-10-02 14:57:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13474 states. [2019-10-02 14:57:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13474 states to 13474 states and 18961 transitions. [2019-10-02 14:57:24,990 INFO L78 Accepts]: Start accepts. Automaton has 13474 states and 18961 transitions. Word has length 67 [2019-10-02 14:57:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:24,991 INFO L475 AbstractCegarLoop]: Abstraction has 13474 states and 18961 transitions. [2019-10-02 14:57:24,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13474 states and 18961 transitions. [2019-10-02 14:57:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:57:24,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:24,993 INFO L411 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] [2019-10-02 14:57:24,993 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1374992007, now seen corresponding path program 1 times [2019-10-02 14:57:24,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:24,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:24,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:25,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:25,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:25,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:25,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:25,034 INFO L87 Difference]: Start difference. First operand 13474 states and 18961 transitions. Second operand 3 states. [2019-10-02 14:57:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:27,382 INFO L93 Difference]: Finished difference Result 18200 states and 25530 transitions. [2019-10-02 14:57:27,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:27,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-02 14:57:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:27,395 INFO L225 Difference]: With dead ends: 18200 [2019-10-02 14:57:27,395 INFO L226 Difference]: Without dead ends: 12096 [2019-10-02 14:57:27,401 INFO L640 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-10-02 14:57:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12096 states. [2019-10-02 14:57:29,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12096 to 12094. [2019-10-02 14:57:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12094 states. [2019-10-02 14:57:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12094 states to 12094 states and 16721 transitions. [2019-10-02 14:57:29,586 INFO L78 Accepts]: Start accepts. Automaton has 12094 states and 16721 transitions. Word has length 67 [2019-10-02 14:57:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:29,586 INFO L475 AbstractCegarLoop]: Abstraction has 12094 states and 16721 transitions. [2019-10-02 14:57:29,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 12094 states and 16721 transitions. [2019-10-02 14:57:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:57:29,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:29,588 INFO L411 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] [2019-10-02 14:57:29,589 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:29,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:29,589 INFO L82 PathProgramCache]: Analyzing trace with hash 731179949, now seen corresponding path program 1 times [2019-10-02 14:57:29,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:29,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:29,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:29,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:29,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:29,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:29,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:29,628 INFO L87 Difference]: Start difference. First operand 12094 states and 16721 transitions. Second operand 3 states. [2019-10-02 14:57:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:31,747 INFO L93 Difference]: Finished difference Result 14708 states and 20236 transitions. [2019-10-02 14:57:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:31,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-02 14:57:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:31,760 INFO L225 Difference]: With dead ends: 14708 [2019-10-02 14:57:31,761 INFO L226 Difference]: Without dead ends: 10309 [2019-10-02 14:57:31,766 INFO L640 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-10-02 14:57:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10309 states. [2019-10-02 14:57:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10309 to 10307. [2019-10-02 14:57:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10307 states. [2019-10-02 14:57:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10307 states to 10307 states and 13953 transitions. [2019-10-02 14:57:33,635 INFO L78 Accepts]: Start accepts. Automaton has 10307 states and 13953 transitions. Word has length 67 [2019-10-02 14:57:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:33,636 INFO L475 AbstractCegarLoop]: Abstraction has 10307 states and 13953 transitions. [2019-10-02 14:57:33,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 10307 states and 13953 transitions. [2019-10-02 14:57:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:57:33,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:33,638 INFO L411 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-10-02 14:57:33,638 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1663214200, now seen corresponding path program 1 times [2019-10-02 14:57:33,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:33,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:33,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:33,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:33,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:34,375 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-10-02 14:57:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:34,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:34,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 14:57:34,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:57:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:57:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:57:35,000 INFO L87 Difference]: Start difference. First operand 10307 states and 13953 transitions. Second operand 23 states. [2019-10-02 14:57:35,270 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-10-02 14:57:36,280 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-02 14:57:36,596 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 14:57:36,900 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-10-02 14:57:39,494 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-10-02 14:57:39,921 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-10-02 14:57:40,101 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-02 14:57:40,394 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-02 14:57:40,776 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-02 14:57:41,275 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-10-02 14:57:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:55,220 INFO L93 Difference]: Finished difference Result 37642 states and 51429 transitions. [2019-10-02 14:57:55,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:57:55,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-02 14:57:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:55,258 INFO L225 Difference]: With dead ends: 37642 [2019-10-02 14:57:55,258 INFO L226 Difference]: Without dead ends: 37076 [2019-10-02 14:57:55,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=455, Invalid=2197, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:57:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37076 states. [2019-10-02 14:57:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37076 to 10319. [2019-10-02 14:57:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10319 states. [2019-10-02 14:57:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10319 states to 10319 states and 13968 transitions. [2019-10-02 14:57:57,588 INFO L78 Accepts]: Start accepts. Automaton has 10319 states and 13968 transitions. Word has length 68 [2019-10-02 14:57:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:57,589 INFO L475 AbstractCegarLoop]: Abstraction has 10319 states and 13968 transitions. [2019-10-02 14:57:57,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:57:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 10319 states and 13968 transitions. [2019-10-02 14:57:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:57:57,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:57,591 INFO L411 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-10-02 14:57:57,591 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:57,591 INFO L82 PathProgramCache]: Analyzing trace with hash 668370156, now seen corresponding path program 1 times [2019-10-02 14:57:57,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:57,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:57,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:57,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:57,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:58,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:58,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 14:57:58,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:57:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:57:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:57:58,245 INFO L87 Difference]: Start difference. First operand 10319 states and 13968 transitions. Second operand 23 states. [2019-10-02 14:57:58,466 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-10-02 14:57:59,405 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-02 14:57:59,625 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-02 14:58:00,056 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-02 14:58:00,338 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-02 14:58:01,124 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-02 14:58:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:13,251 INFO L93 Difference]: Finished difference Result 35349 states and 48299 transitions. [2019-10-02 14:58:13,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:58:13,251 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-02 14:58:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:13,284 INFO L225 Difference]: With dead ends: 35349 [2019-10-02 14:58:13,284 INFO L226 Difference]: Without dead ends: 34783 [2019-10-02 14:58:13,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=380, Invalid=1600, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:58:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34783 states. [2019-10-02 14:58:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34783 to 10301. [2019-10-02 14:58:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-10-02 14:58:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 13943 transitions. [2019-10-02 14:58:15,734 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 13943 transitions. Word has length 68 [2019-10-02 14:58:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:15,734 INFO L475 AbstractCegarLoop]: Abstraction has 10301 states and 13943 transitions. [2019-10-02 14:58:15,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:58:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 13943 transitions. [2019-10-02 14:58:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:58:15,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:15,737 INFO L411 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-10-02 14:58:15,738 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1249568560, now seen corresponding path program 1 times [2019-10-02 14:58:15,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:15,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:16,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:16,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 14:58:16,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:58:16,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:58:16,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:58:16,485 INFO L87 Difference]: Start difference. First operand 10301 states and 13943 transitions. Second operand 23 states. [2019-10-02 14:58:18,174 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-10-02 14:58:21,219 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-02 14:58:21,693 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-02 14:58:24,003 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-02 14:58:24,619 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-10-02 14:58:25,036 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-10-02 14:58:25,216 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-02 14:58:25,476 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-02 14:58:25,844 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 14:58:26,052 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 14:58:26,342 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-02 14:58:26,743 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 14:58:26,914 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-02 14:58:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:41,768 INFO L93 Difference]: Finished difference Result 46679 states and 63782 transitions. [2019-10-02 14:58:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:58:41,768 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-10-02 14:58:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:41,816 INFO L225 Difference]: With dead ends: 46679 [2019-10-02 14:58:41,817 INFO L226 Difference]: Without dead ends: 46113 [2019-10-02 14:58:41,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:58:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46113 states. [2019-10-02 14:58:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46113 to 10283. [2019-10-02 14:58:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10283 states. [2019-10-02 14:58:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10283 states to 10283 states and 13918 transitions. [2019-10-02 14:58:44,608 INFO L78 Accepts]: Start accepts. Automaton has 10283 states and 13918 transitions. Word has length 68 [2019-10-02 14:58:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:44,609 INFO L475 AbstractCegarLoop]: Abstraction has 10283 states and 13918 transitions. [2019-10-02 14:58:44,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:58:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 10283 states and 13918 transitions. [2019-10-02 14:58:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:58:44,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:44,611 INFO L411 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-10-02 14:58:44,611 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2039898992, now seen corresponding path program 1 times [2019-10-02 14:58:44,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:44,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:44,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:44,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:44,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:44,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:44,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:44,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:44,646 INFO L87 Difference]: Start difference. First operand 10283 states and 13918 transitions. Second operand 3 states. [2019-10-02 14:58:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:48,549 INFO L93 Difference]: Finished difference Result 19096 states and 25938 transitions. [2019-10-02 14:58:48,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:48,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-02 14:58:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:48,570 INFO L225 Difference]: With dead ends: 19096 [2019-10-02 14:58:48,570 INFO L226 Difference]: Without dead ends: 15189 [2019-10-02 14:58:48,578 INFO L640 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-10-02 14:58:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15189 states. [2019-10-02 14:58:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15189 to 10143. [2019-10-02 14:58:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10143 states. [2019-10-02 14:58:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10143 states to 10143 states and 13710 transitions. [2019-10-02 14:58:51,398 INFO L78 Accepts]: Start accepts. Automaton has 10143 states and 13710 transitions. Word has length 68 [2019-10-02 14:58:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:51,398 INFO L475 AbstractCegarLoop]: Abstraction has 10143 states and 13710 transitions. [2019-10-02 14:58:51,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10143 states and 13710 transitions. [2019-10-02 14:58:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:58:51,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:51,400 INFO L411 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-10-02 14:58:51,400 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1357870159, now seen corresponding path program 1 times [2019-10-02 14:58:51,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:51,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:51,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:51,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:51,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:51,434 INFO L87 Difference]: Start difference. First operand 10143 states and 13710 transitions. Second operand 3 states. [2019-10-02 14:58:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:55,532 INFO L93 Difference]: Finished difference Result 18920 states and 25663 transitions. [2019-10-02 14:58:55,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:55,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-02 14:58:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:55,548 INFO L225 Difference]: With dead ends: 18920 [2019-10-02 14:58:55,548 INFO L226 Difference]: Without dead ends: 14995 [2019-10-02 14:58:55,553 INFO L640 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-10-02 14:58:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14995 states. [2019-10-02 14:58:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14995 to 9949. [2019-10-02 14:58:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9949 states. [2019-10-02 14:58:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9949 states to 9949 states and 13439 transitions. [2019-10-02 14:58:58,450 INFO L78 Accepts]: Start accepts. Automaton has 9949 states and 13439 transitions. Word has length 68 [2019-10-02 14:58:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:58,450 INFO L475 AbstractCegarLoop]: Abstraction has 9949 states and 13439 transitions. [2019-10-02 14:58:58,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9949 states and 13439 transitions. [2019-10-02 14:58:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 14:58:58,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:58,452 INFO L411 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-10-02 14:58:58,452 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1380296776, now seen corresponding path program 1 times [2019-10-02 14:58:58,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:58,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:58,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:58:58,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:58:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:58:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:58:58,875 INFO L87 Difference]: Start difference. First operand 9949 states and 13439 transitions. Second operand 13 states. [2019-10-02 14:58:59,276 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-10-02 14:58:59,439 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-02 14:58:59,632 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-02 14:58:59,804 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 14:59:00,202 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-02 14:59:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:09,107 INFO L93 Difference]: Finished difference Result 29889 states and 40640 transitions. [2019-10-02 14:59:09,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:59:09,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-10-02 14:59:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:09,138 INFO L225 Difference]: With dead ends: 29889 [2019-10-02 14:59:09,138 INFO L226 Difference]: Without dead ends: 27592 [2019-10-02 14:59:09,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:59:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27592 states. [2019-10-02 14:59:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27592 to 9863. [2019-10-02 14:59:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9863 states. [2019-10-02 14:59:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 13329 transitions. [2019-10-02 14:59:12,358 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 13329 transitions. Word has length 69 [2019-10-02 14:59:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:12,358 INFO L475 AbstractCegarLoop]: Abstraction has 9863 states and 13329 transitions. [2019-10-02 14:59:12,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:59:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 13329 transitions. [2019-10-02 14:59:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 14:59:12,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:12,361 INFO L411 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-10-02 14:59:12,361 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash -662360376, now seen corresponding path program 1 times [2019-10-02 14:59:12,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:12,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:12,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:12,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:12,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:59:12,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:59:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:59:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:59:12,704 INFO L87 Difference]: Start difference. First operand 9863 states and 13329 transitions. Second operand 11 states. [2019-10-02 14:59:13,077 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 14:59:13,221 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-02 14:59:13,380 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-02 14:59:13,554 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-02 14:59:13,935 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-02 14:59:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:22,832 INFO L93 Difference]: Finished difference Result 25870 states and 35131 transitions. [2019-10-02 14:59:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:59:22,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-10-02 14:59:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:22,856 INFO L225 Difference]: With dead ends: 25870 [2019-10-02 14:59:22,856 INFO L226 Difference]: Without dead ends: 24094 [2019-10-02 14:59:22,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:59:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24094 states. [2019-10-02 14:59:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24094 to 9793. [2019-10-02 14:59:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9793 states. [2019-10-02 14:59:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9793 states to 9793 states and 13237 transitions. [2019-10-02 14:59:26,219 INFO L78 Accepts]: Start accepts. Automaton has 9793 states and 13237 transitions. Word has length 69 [2019-10-02 14:59:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:26,220 INFO L475 AbstractCegarLoop]: Abstraction has 9793 states and 13237 transitions. [2019-10-02 14:59:26,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:59:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 9793 states and 13237 transitions. [2019-10-02 14:59:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 14:59:26,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:26,222 INFO L411 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-10-02 14:59:26,222 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:26,223 INFO L82 PathProgramCache]: Analyzing trace with hash 941099548, now seen corresponding path program 1 times [2019-10-02 14:59:26,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:26,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:26,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:26,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:59:26,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:59:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:59:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:59:26,289 INFO L87 Difference]: Start difference. First operand 9793 states and 13237 transitions. Second operand 5 states. [2019-10-02 14:59:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:29,611 INFO L93 Difference]: Finished difference Result 9799 states and 13240 transitions. [2019-10-02 14:59:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:59:29,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-02 14:59:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:29,620 INFO L225 Difference]: With dead ends: 9799 [2019-10-02 14:59:29,621 INFO L226 Difference]: Without dead ends: 9419 [2019-10-02 14:59:29,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:59:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9419 states. [2019-10-02 14:59:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9419 to 9415. [2019-10-02 14:59:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9415 states. [2019-10-02 14:59:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9415 states to 9415 states and 12750 transitions. [2019-10-02 14:59:32,833 INFO L78 Accepts]: Start accepts. Automaton has 9415 states and 12750 transitions. Word has length 72 [2019-10-02 14:59:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:32,833 INFO L475 AbstractCegarLoop]: Abstraction has 9415 states and 12750 transitions. [2019-10-02 14:59:32,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:59:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9415 states and 12750 transitions. [2019-10-02 14:59:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 14:59:32,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:32,835 INFO L411 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-10-02 14:59:32,836 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1594855658, now seen corresponding path program 1 times [2019-10-02 14:59:32,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:32,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:32,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:32,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:32,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:59:32,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:59:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:59:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:59:32,926 INFO L87 Difference]: Start difference. First operand 9415 states and 12750 transitions. Second operand 6 states. [2019-10-02 14:59:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:39,742 INFO L93 Difference]: Finished difference Result 17839 states and 23932 transitions. [2019-10-02 14:59:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:59:39,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-10-02 14:59:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:39,761 INFO L225 Difference]: With dead ends: 17839 [2019-10-02 14:59:39,761 INFO L226 Difference]: Without dead ends: 17837 [2019-10-02 14:59:39,765 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:59:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17837 states. [2019-10-02 14:59:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17837 to 9730. [2019-10-02 14:59:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9730 states. [2019-10-02 14:59:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9730 states to 9730 states and 12980 transitions. [2019-10-02 14:59:43,224 INFO L78 Accepts]: Start accepts. Automaton has 9730 states and 12980 transitions. Word has length 75 [2019-10-02 14:59:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:43,225 INFO L475 AbstractCegarLoop]: Abstraction has 9730 states and 12980 transitions. [2019-10-02 14:59:43,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:59:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 9730 states and 12980 transitions. [2019-10-02 14:59:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 14:59:43,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:43,228 INFO L411 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-10-02 14:59:43,229 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash -242700483, now seen corresponding path program 1 times [2019-10-02 14:59:43,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:43,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:43,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:43,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:43,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:43,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:43,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:43,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:43,281 INFO L87 Difference]: Start difference. First operand 9730 states and 12980 transitions. Second operand 3 states. [2019-10-02 14:59:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:49,904 INFO L93 Difference]: Finished difference Result 27206 states and 36264 transitions. [2019-10-02 14:59:49,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:59:49,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-02 14:59:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:49,923 INFO L225 Difference]: With dead ends: 27206 [2019-10-02 14:59:49,923 INFO L226 Difference]: Without dead ends: 18047 [2019-10-02 14:59:49,931 INFO L640 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-10-02 14:59:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18047 states. [2019-10-02 14:59:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18047 to 16903. [2019-10-02 14:59:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2019-10-02 14:59:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 22375 transitions. [2019-10-02 14:59:56,084 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 22375 transitions. Word has length 76 [2019-10-02 14:59:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:56,085 INFO L475 AbstractCegarLoop]: Abstraction has 16903 states and 22375 transitions. [2019-10-02 14:59:56,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:59:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 22375 transitions. [2019-10-02 14:59:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 14:59:56,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:56,087 INFO L411 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-10-02 14:59:56,087 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2061431257, now seen corresponding path program 1 times [2019-10-02 14:59:56,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:56,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:56,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:56,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:56,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:56,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:56,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:56,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:56,136 INFO L87 Difference]: Start difference. First operand 16903 states and 22375 transitions. Second operand 3 states. [2019-10-02 15:00:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:08,187 INFO L93 Difference]: Finished difference Result 47710 states and 62872 transitions. [2019-10-02 15:00:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:08,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-02 15:00:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:08,221 INFO L225 Difference]: With dead ends: 47710 [2019-10-02 15:00:08,221 INFO L226 Difference]: Without dead ends: 31266 [2019-10-02 15:00:08,236 INFO L640 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-10-02 15:00:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31266 states. [2019-10-02 15:00:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31266 to 29192. [2019-10-02 15:00:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29192 states. [2019-10-02 15:00:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29192 states to 29192 states and 38198 transitions. [2019-10-02 15:00:19,268 INFO L78 Accepts]: Start accepts. Automaton has 29192 states and 38198 transitions. Word has length 77 [2019-10-02 15:00:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:19,269 INFO L475 AbstractCegarLoop]: Abstraction has 29192 states and 38198 transitions. [2019-10-02 15:00:19,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 29192 states and 38198 transitions. [2019-10-02 15:00:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 15:00:19,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:19,271 INFO L411 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-10-02 15:00:19,271 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash -936347122, now seen corresponding path program 1 times [2019-10-02 15:00:19,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:19,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:19,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:19,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:19,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:19,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:19,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:19,311 INFO L87 Difference]: Start difference. First operand 29192 states and 38198 transitions. Second operand 3 states. [2019-10-02 15:00:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:36,564 INFO L93 Difference]: Finished difference Result 71992 states and 93908 transitions. [2019-10-02 15:00:36,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:36,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-02 15:00:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:36,611 INFO L225 Difference]: With dead ends: 71992 [2019-10-02 15:00:36,611 INFO L226 Difference]: Without dead ends: 43278 [2019-10-02 15:00:36,632 INFO L640 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-10-02 15:00:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43278 states. [2019-10-02 15:00:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43278 to 43276. [2019-10-02 15:00:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43276 states. [2019-10-02 15:00:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43276 states to 43276 states and 55850 transitions. [2019-10-02 15:00:52,829 INFO L78 Accepts]: Start accepts. Automaton has 43276 states and 55850 transitions. Word has length 77 [2019-10-02 15:00:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:52,829 INFO L475 AbstractCegarLoop]: Abstraction has 43276 states and 55850 transitions. [2019-10-02 15:00:52,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 43276 states and 55850 transitions. [2019-10-02 15:00:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 15:00:52,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:52,832 INFO L411 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] [2019-10-02 15:00:52,833 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1962110619, now seen corresponding path program 1 times [2019-10-02 15:00:52,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:52,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:52,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:52,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:52,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:52,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:00:52,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:00:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:00:52,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:52,883 INFO L87 Difference]: Start difference. First operand 43276 states and 55850 transitions. Second operand 5 states. [2019-10-02 15:01:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:25,597 INFO L93 Difference]: Finished difference Result 120433 states and 153840 transitions. [2019-10-02 15:01:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:01:25,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-02 15:01:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:25,703 INFO L225 Difference]: With dead ends: 120433 [2019-10-02 15:01:25,703 INFO L226 Difference]: Without dead ends: 77635 [2019-10-02 15:01:25,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:01:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77635 states. [2019-10-02 15:01:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77635 to 48088. [2019-10-02 15:01:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48088 states. [2019-10-02 15:01:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48088 states to 48088 states and 61328 transitions. [2019-10-02 15:01:43,959 INFO L78 Accepts]: Start accepts. Automaton has 48088 states and 61328 transitions. Word has length 87 [2019-10-02 15:01:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:43,959 INFO L475 AbstractCegarLoop]: Abstraction has 48088 states and 61328 transitions. [2019-10-02 15:01:43,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:01:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 48088 states and 61328 transitions. [2019-10-02 15:01:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 15:01:43,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:43,964 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:43,964 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash 408691093, now seen corresponding path program 1 times [2019-10-02 15:01:43,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:43,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:43,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:43,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:44,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:44,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:44,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:44,020 INFO L87 Difference]: Start difference. First operand 48088 states and 61328 transitions. Second operand 3 states. [2019-10-02 15:02:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:20,057 INFO L93 Difference]: Finished difference Result 137734 states and 174722 transitions. [2019-10-02 15:02:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:20,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-02 15:02:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:20,157 INFO L225 Difference]: With dead ends: 137734 [2019-10-02 15:02:20,157 INFO L226 Difference]: Without dead ends: 90124 [2019-10-02 15:02:20,311 INFO L640 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-10-02 15:02:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90124 states. [2019-10-02 15:02:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90124 to 78704. [2019-10-02 15:02:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78704 states. [2019-10-02 15:02:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78704 states to 78704 states and 98680 transitions. [2019-10-02 15:02:52,624 INFO L78 Accepts]: Start accepts. Automaton has 78704 states and 98680 transitions. Word has length 96 [2019-10-02 15:02:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:52,624 INFO L475 AbstractCegarLoop]: Abstraction has 78704 states and 98680 transitions. [2019-10-02 15:02:52,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 78704 states and 98680 transitions. [2019-10-02 15:02:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 15:02:52,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:52,631 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:52,631 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:52,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1281005310, now seen corresponding path program 1 times [2019-10-02 15:02:52,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:52,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:52,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:52,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:52,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:52,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:02:52,741 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:02:52,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:52,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 15:02:52,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:02:53,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:02:53,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:02:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:53,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:02:53,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 15 [2019-10-02 15:02:53,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 15:02:53,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 15:02:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 15:02:53,796 INFO L87 Difference]: Start difference. First operand 78704 states and 98680 transitions. Second operand 15 states. [2019-10-02 15:02:54,321 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-02 15:02:54,632 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-02 15:02:56,206 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 15:02:56,674 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-02 15:02:57,504 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-02 15:02:58,514 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-10-02 15:02:58,818 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-02 15:02:59,354 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-02 15:03:00,241 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-02 15:03:00,685 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-02 15:03:02,149 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-02 15:03:02,361 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 15:03:07,116 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-02 15:03:07,290 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 15:03:07,700 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-02 15:03:08,646 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 15:03:10,454 WARN L191 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-10-02 15:03:10,912 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-02 15:03:18,904 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-02 15:03:20,248 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-02 15:03:22,685 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-02 15:03:23,680 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-10-02 15:03:23,830 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-02 15:03:24,114 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-02 15:03:26,849 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-02 15:04:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:17,569 INFO L93 Difference]: Finished difference Result 241427 states and 302040 transitions. [2019-10-02 15:04:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-02 15:04:17,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2019-10-02 15:04:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:18,134 INFO L225 Difference]: With dead ends: 241427 [2019-10-02 15:04:18,135 INFO L226 Difference]: Without dead ends: 163201 [2019-10-02 15:04:18,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1042, Invalid=4508, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 15:04:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163201 states. [2019-10-02 15:05:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163201 to 137416. [2019-10-02 15:05:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137416 states. [2019-10-02 15:05:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137416 states to 137416 states and 171642 transitions. [2019-10-02 15:05:20,062 INFO L78 Accepts]: Start accepts. Automaton has 137416 states and 171642 transitions. Word has length 99 [2019-10-02 15:05:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:20,062 INFO L475 AbstractCegarLoop]: Abstraction has 137416 states and 171642 transitions. [2019-10-02 15:05:20,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 15:05:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 137416 states and 171642 transitions. [2019-10-02 15:05:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 15:05:20,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:20,095 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:20,095 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 25351875, now seen corresponding path program 1 times [2019-10-02 15:05:20,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:20,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:20,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:20,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 15:05:20,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:20,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:20,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:20,176 INFO L87 Difference]: Start difference. First operand 137416 states and 171642 transitions. Second operand 4 states. [2019-10-02 15:06:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:46,586 INFO L93 Difference]: Finished difference Result 302751 states and 377601 transitions. [2019-10-02 15:06:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:06:46,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-02 15:06:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:46,979 INFO L225 Difference]: With dead ends: 302751 [2019-10-02 15:06:46,979 INFO L226 Difference]: Without dead ends: 196901 [2019-10-02 15:06:47,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:06:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196901 states. [2019-10-02 15:07:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196901 to 137359. [2019-10-02 15:07:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137359 states. [2019-10-02 15:07:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137359 states to 137359 states and 171581 transitions. [2019-10-02 15:07:49,143 INFO L78 Accepts]: Start accepts. Automaton has 137359 states and 171581 transitions. Word has length 109 [2019-10-02 15:07:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:49,143 INFO L475 AbstractCegarLoop]: Abstraction has 137359 states and 171581 transitions. [2019-10-02 15:07:49,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:07:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 137359 states and 171581 transitions. [2019-10-02 15:07:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 15:07:49,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:49,154 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:49,154 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash -545064706, now seen corresponding path program 1 times [2019-10-02 15:07:49,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:49,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:07:49,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:07:49,234 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:07:49,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:49,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 15:07:49,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:07:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 15:07:49,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:07:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-10-02 15:07:49,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:07:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:07:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:07:49,889 INFO L87 Difference]: Start difference. First operand 137359 states and 171581 transitions. Second operand 10 states. [2019-10-02 15:09:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:06,915 INFO L93 Difference]: Finished difference Result 301982 states and 376156 transitions. [2019-10-02 15:09:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 15:09:06,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2019-10-02 15:09:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:07,115 INFO L225 Difference]: With dead ends: 301982 [2019-10-02 15:09:07,115 INFO L226 Difference]: Without dead ends: 165002 [2019-10-02 15:09:07,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-02 15:09:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165002 states.