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.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:18:46,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:18:46,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:18:46,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:18:46,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:18:46,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:18:46,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:18:46,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:18:46,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:18:46,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:18:46,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:18:46,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:18:46,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:18:46,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:18:46,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:18:46,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:18:46,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:18:46,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:18:46,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:18:46,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:18:46,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:18:46,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:18:46,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:18:46,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:18:46,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:18:46,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:18:46,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:18:46,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:18:46,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:18:46,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:18:46,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:18:46,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:18:46,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:18:46,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:18:46,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:18:46,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:18:46,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:18:46,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:18:46,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:18:46,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:18:46,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:18:46,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:18:46,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:18:46,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:18:46,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:18:46,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:18:46,123 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:18:46,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:18:46,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:18:46,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:18:46,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:18:46,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:18:46,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:18:46,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:18:46,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:18:46,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:18:46,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:18:46,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:18:46,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:18:46,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:18:46,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:18:46,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:18:46,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:18:46,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:18:46,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:18:46,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:18:46,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:18:46,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:18:46,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:18:46,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:18:46,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:18:46,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:18:46,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:18:46,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:18:46,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:18:46,184 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:18:46,185 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.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:18:46,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ee049fa/6634aca7e823411fb6028b18fac32b85/FLAGabb7982c3 [2019-09-08 10:18:46,798 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:18:46,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:18:46,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ee049fa/6634aca7e823411fb6028b18fac32b85/FLAGabb7982c3 [2019-09-08 10:18:47,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ee049fa/6634aca7e823411fb6028b18fac32b85 [2019-09-08 10:18:47,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:18:47,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:18:47,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:18:47,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:18:47,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:18:47,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2aa5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47, skipping insertion in model container [2019-09-08 10:18:47,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,099 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:18:47,162 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:18:47,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:18:47,592 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:18:47,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:18:47,737 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:18:47,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47 WrapperNode [2019-09-08 10:18:47,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:18:47,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:18:47,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:18:47,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:18:47,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... [2019-09-08 10:18:47,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:18:47,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:18:47,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:18:47,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:18:47,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:18:47,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:18:47,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:18:47,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:18:47,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:18:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:18:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:18:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:18:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:18:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:18:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:18:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:18:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:18:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:18:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:18:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:18:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:18:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:18:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:18:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:18:48,694 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:18:48,695 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:18:48,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:18:48 BoogieIcfgContainer [2019-09-08 10:18:48,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:18:48,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:18:48,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:18:48,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:18:48,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:18:47" (1/3) ... [2019-09-08 10:18:48,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7daa8d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:18:48, skipping insertion in model container [2019-09-08 10:18:48,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:47" (2/3) ... [2019-09-08 10:18:48,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7daa8d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:18:48, skipping insertion in model container [2019-09-08 10:18:48,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:18:48" (3/3) ... [2019-09-08 10:18:48,706 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:18:48,718 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:18:48,739 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:18:48,759 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:18:48,804 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:18:48,804 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:18:48,805 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:18:48,805 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:18:48,805 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:18:48,806 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:18:48,806 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:18:48,806 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:18:48,806 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:18:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-09-08 10:18:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:18:48,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:48,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:48,848 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash -418135505, now seen corresponding path program 1 times [2019-09-08 10:18:48,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:48,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:49,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:49,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:18:49,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:18:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:18:49,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:18:49,359 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 6 states. [2019-09-08 10:18:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:49,835 INFO L93 Difference]: Finished difference Result 790 states and 1253 transitions. [2019-09-08 10:18:49,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:18:49,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-09-08 10:18:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:49,860 INFO L225 Difference]: With dead ends: 790 [2019-09-08 10:18:49,860 INFO L226 Difference]: Without dead ends: 694 [2019-09-08 10:18:49,865 INFO L628 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-09-08 10:18:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-08 10:18:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 467. [2019-09-08 10:18:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-08 10:18:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 717 transitions. [2019-09-08 10:18:49,982 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 717 transitions. Word has length 53 [2019-09-08 10:18:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:49,983 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 717 transitions. [2019-09-08 10:18:49,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:18:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 717 transitions. [2019-09-08 10:18:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:18:49,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:49,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:49,987 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash 914126686, now seen corresponding path program 1 times [2019-09-08 10:18:49,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:49,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:49,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:50,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:50,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:50,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:50,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:50,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:50,104 INFO L87 Difference]: Start difference. First operand 467 states and 717 transitions. Second operand 3 states. [2019-09-08 10:18:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:50,186 INFO L93 Difference]: Finished difference Result 1228 states and 1911 transitions. [2019-09-08 10:18:50,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:50,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:18:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:50,193 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 10:18:50,194 INFO L226 Difference]: Without dead ends: 832 [2019-09-08 10:18:50,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-09-08 10:18:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2019-09-08 10:18:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-09-08 10:18:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1272 transitions. [2019-09-08 10:18:50,273 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1272 transitions. Word has length 56 [2019-09-08 10:18:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:50,274 INFO L475 AbstractCegarLoop]: Abstraction has 830 states and 1272 transitions. [2019-09-08 10:18:50,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1272 transitions. [2019-09-08 10:18:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:18:50,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:50,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:50,288 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1604405792, now seen corresponding path program 1 times [2019-09-08 10:18:50,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:50,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:50,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:50,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:50,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:50,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:50,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:50,407 INFO L87 Difference]: Start difference. First operand 830 states and 1272 transitions. Second operand 3 states. [2019-09-08 10:18:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:50,526 INFO L93 Difference]: Finished difference Result 2170 states and 3341 transitions. [2019-09-08 10:18:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:50,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:18:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:50,570 INFO L225 Difference]: With dead ends: 2170 [2019-09-08 10:18:50,570 INFO L226 Difference]: Without dead ends: 1419 [2019-09-08 10:18:50,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-09-08 10:18:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2019-09-08 10:18:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2019-09-08 10:18:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2019-09-08 10:18:50,662 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 56 [2019-09-08 10:18:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:50,665 INFO L475 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2019-09-08 10:18:50,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2019-09-08 10:18:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:18:50,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:50,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:50,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1855390903, now seen corresponding path program 1 times [2019-09-08 10:18:50,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:50,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:50,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:50,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:50,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:18:50,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:18:50,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:18:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:18:50,810 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 transitions. Second operand 5 states. [2019-09-08 10:18:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:51,346 INFO L93 Difference]: Finished difference Result 4051 states and 6141 transitions. [2019-09-08 10:18:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:18:51,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-08 10:18:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:51,361 INFO L225 Difference]: With dead ends: 4051 [2019-09-08 10:18:51,361 INFO L226 Difference]: Without dead ends: 2665 [2019-09-08 10:18:51,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:18:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2019-09-08 10:18:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2648. [2019-09-08 10:18:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2648 states. [2019-09-08 10:18:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3991 transitions. [2019-09-08 10:18:51,576 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 3991 transitions. Word has length 57 [2019-09-08 10:18:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:51,577 INFO L475 AbstractCegarLoop]: Abstraction has 2648 states and 3991 transitions. [2019-09-08 10:18:51,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:18:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3991 transitions. [2019-09-08 10:18:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:18:51,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:51,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:51,584 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:51,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:51,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1758328390, now seen corresponding path program 1 times [2019-09-08 10:18:51,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:51,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:51,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:51,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:51,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:18:51,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:18:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:18:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:18:51,745 INFO L87 Difference]: Start difference. First operand 2648 states and 3991 transitions. Second operand 6 states. [2019-09-08 10:18:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:52,422 INFO L93 Difference]: Finished difference Result 8534 states and 12886 transitions. [2019-09-08 10:18:52,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:18:52,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:18:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:52,464 INFO L225 Difference]: With dead ends: 8534 [2019-09-08 10:18:52,465 INFO L226 Difference]: Without dead ends: 5935 [2019-09-08 10:18:52,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:18:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5935 states. [2019-09-08 10:18:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5935 to 5891. [2019-09-08 10:18:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5891 states. [2019-09-08 10:18:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5891 states to 5891 states and 8868 transitions. [2019-09-08 10:18:52,928 INFO L78 Accepts]: Start accepts. Automaton has 5891 states and 8868 transitions. Word has length 57 [2019-09-08 10:18:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:52,930 INFO L475 AbstractCegarLoop]: Abstraction has 5891 states and 8868 transitions. [2019-09-08 10:18:52,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:18:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5891 states and 8868 transitions. [2019-09-08 10:18:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:18:52,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:52,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:52,934 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1592153131, now seen corresponding path program 1 times [2019-09-08 10:18:52,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:52,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:52,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:52,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:52,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:53,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:53,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:18:53,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:18:53,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:18:53,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:18:53,106 INFO L87 Difference]: Start difference. First operand 5891 states and 8868 transitions. Second operand 7 states. [2019-09-08 10:18:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:54,820 INFO L93 Difference]: Finished difference Result 26488 states and 39600 transitions. [2019-09-08 10:18:54,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:18:54,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:18:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:54,932 INFO L225 Difference]: With dead ends: 26488 [2019-09-08 10:18:54,933 INFO L226 Difference]: Without dead ends: 21237 [2019-09-08 10:18:54,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:18:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21237 states. [2019-09-08 10:18:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21237 to 5911. [2019-09-08 10:18:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5911 states. [2019-09-08 10:18:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 8892 transitions. [2019-09-08 10:18:55,570 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 8892 transitions. Word has length 58 [2019-09-08 10:18:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:55,571 INFO L475 AbstractCegarLoop]: Abstraction has 5911 states and 8892 transitions. [2019-09-08 10:18:55,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:18:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 8892 transitions. [2019-09-08 10:18:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:18:55,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:55,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:55,574 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash -908950199, now seen corresponding path program 1 times [2019-09-08 10:18:55,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:55,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:55,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:55,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:55,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:55,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:55,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:18:55,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:18:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:18:55,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:18:55,693 INFO L87 Difference]: Start difference. First operand 5911 states and 8892 transitions. Second operand 7 states. [2019-09-08 10:18:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:58,068 INFO L93 Difference]: Finished difference Result 34049 states and 51551 transitions. [2019-09-08 10:18:58,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:18:58,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:18:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:58,143 INFO L225 Difference]: With dead ends: 34049 [2019-09-08 10:18:58,144 INFO L226 Difference]: Without dead ends: 31529 [2019-09-08 10:18:58,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:18:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31529 states. [2019-09-08 10:18:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31529 to 5947. [2019-09-08 10:18:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5947 states. [2019-09-08 10:18:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5947 states to 5947 states and 8938 transitions. [2019-09-08 10:18:58,828 INFO L78 Accepts]: Start accepts. Automaton has 5947 states and 8938 transitions. Word has length 58 [2019-09-08 10:18:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:58,830 INFO L475 AbstractCegarLoop]: Abstraction has 5947 states and 8938 transitions. [2019-09-08 10:18:58,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:18:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5947 states and 8938 transitions. [2019-09-08 10:18:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:18:58,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:58,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:58,833 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash -201532434, now seen corresponding path program 1 times [2019-09-08 10:18:58,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:58,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:58,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:58,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:18:58,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:18:58,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:18:58,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:18:58,933 INFO L87 Difference]: Start difference. First operand 5947 states and 8938 transitions. Second operand 6 states. [2019-09-08 10:19:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:00,166 INFO L93 Difference]: Finished difference Result 21671 states and 32554 transitions. [2019-09-08 10:19:00,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:19:00,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-08 10:19:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:00,206 INFO L225 Difference]: With dead ends: 21671 [2019-09-08 10:19:00,206 INFO L226 Difference]: Without dead ends: 15843 [2019-09-08 10:19:00,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:19:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15843 states. [2019-09-08 10:19:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15843 to 15839. [2019-09-08 10:19:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15839 states. [2019-09-08 10:19:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15839 states to 15839 states and 23554 transitions. [2019-09-08 10:19:01,826 INFO L78 Accepts]: Start accepts. Automaton has 15839 states and 23554 transitions. Word has length 59 [2019-09-08 10:19:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:01,826 INFO L475 AbstractCegarLoop]: Abstraction has 15839 states and 23554 transitions. [2019-09-08 10:19:01,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:19:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15839 states and 23554 transitions. [2019-09-08 10:19:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:19:01,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:01,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:01,830 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1864848650, now seen corresponding path program 1 times [2019-09-08 10:19:01,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:01,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:01,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:19:01,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:19:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:19:01,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:01,908 INFO L87 Difference]: Start difference. First operand 15839 states and 23554 transitions. Second operand 5 states. [2019-09-08 10:19:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:04,158 INFO L93 Difference]: Finished difference Result 41920 states and 62572 transitions. [2019-09-08 10:19:04,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:19:04,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-08 10:19:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:04,238 INFO L225 Difference]: With dead ends: 41920 [2019-09-08 10:19:04,238 INFO L226 Difference]: Without dead ends: 33629 [2019-09-08 10:19:04,270 INFO L628 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-09-08 10:19:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33629 states. [2019-09-08 10:19:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33629 to 20219. [2019-09-08 10:19:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20219 states. [2019-09-08 10:19:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20219 states to 20219 states and 30185 transitions. [2019-09-08 10:19:06,551 INFO L78 Accepts]: Start accepts. Automaton has 20219 states and 30185 transitions. Word has length 60 [2019-09-08 10:19:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:06,552 INFO L475 AbstractCegarLoop]: Abstraction has 20219 states and 30185 transitions. [2019-09-08 10:19:06,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:19:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20219 states and 30185 transitions. [2019-09-08 10:19:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:19:06,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:06,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:06,565 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:06,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash 82558164, now seen corresponding path program 1 times [2019-09-08 10:19:06,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:06,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:06,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:06,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:06,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:06,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:19:06,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:19:06,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:19:06,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:06,651 INFO L87 Difference]: Start difference. First operand 20219 states and 30185 transitions. Second operand 5 states. [2019-09-08 10:19:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:09,209 INFO L93 Difference]: Finished difference Result 44391 states and 66349 transitions. [2019-09-08 10:19:09,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:19:09,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-08 10:19:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:09,296 INFO L225 Difference]: With dead ends: 44391 [2019-09-08 10:19:09,297 INFO L226 Difference]: Without dead ends: 36100 [2019-09-08 10:19:09,324 INFO L628 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-09-08 10:19:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36100 states. [2019-09-08 10:19:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36100 to 23242. [2019-09-08 10:19:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23242 states. [2019-09-08 10:19:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23242 states to 23242 states and 34740 transitions. [2019-09-08 10:19:11,226 INFO L78 Accepts]: Start accepts. Automaton has 23242 states and 34740 transitions. Word has length 60 [2019-09-08 10:19:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:11,226 INFO L475 AbstractCegarLoop]: Abstraction has 23242 states and 34740 transitions. [2019-09-08 10:19:11,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:19:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 23242 states and 34740 transitions. [2019-09-08 10:19:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:19:11,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:11,232 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:11,232 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1576740999, now seen corresponding path program 1 times [2019-09-08 10:19:11,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:11,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:11,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:11,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:19:11,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:19:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:19:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:19:11,308 INFO L87 Difference]: Start difference. First operand 23242 states and 34740 transitions. Second operand 7 states. [2019-09-08 10:19:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:19,233 INFO L93 Difference]: Finished difference Result 111220 states and 164519 transitions. [2019-09-08 10:19:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:19:19,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-08 10:19:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:19,431 INFO L225 Difference]: With dead ends: 111220 [2019-09-08 10:19:19,431 INFO L226 Difference]: Without dead ends: 100199 [2019-09-08 10:19:19,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:19:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100199 states. [2019-09-08 10:19:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100199 to 23370. [2019-09-08 10:19:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23370 states. [2019-09-08 10:19:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23370 states to 23370 states and 34904 transitions. [2019-09-08 10:19:21,704 INFO L78 Accepts]: Start accepts. Automaton has 23370 states and 34904 transitions. Word has length 63 [2019-09-08 10:19:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:21,704 INFO L475 AbstractCegarLoop]: Abstraction has 23370 states and 34904 transitions. [2019-09-08 10:19:21,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:19:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 23370 states and 34904 transitions. [2019-09-08 10:19:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:19:21,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:21,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:21,709 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1496387803, now seen corresponding path program 1 times [2019-09-08 10:19:21,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:21,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:21,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:21,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:21,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:21,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:21,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:21,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:21,751 INFO L87 Difference]: Start difference. First operand 23370 states and 34904 transitions. Second operand 3 states. [2019-09-08 10:19:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:24,820 INFO L93 Difference]: Finished difference Result 57275 states and 85539 transitions. [2019-09-08 10:19:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:24,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 10:19:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:24,894 INFO L225 Difference]: With dead ends: 57275 [2019-09-08 10:19:24,895 INFO L226 Difference]: Without dead ends: 34818 [2019-09-08 10:19:24,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34818 states. [2019-09-08 10:19:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34818 to 28308. [2019-09-08 10:19:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28308 states. [2019-09-08 10:19:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28308 states to 28308 states and 41697 transitions. [2019-09-08 10:19:29,043 INFO L78 Accepts]: Start accepts. Automaton has 28308 states and 41697 transitions. Word has length 63 [2019-09-08 10:19:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:29,043 INFO L475 AbstractCegarLoop]: Abstraction has 28308 states and 41697 transitions. [2019-09-08 10:19:29,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28308 states and 41697 transitions. [2019-09-08 10:19:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:19:29,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:29,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:29,050 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash -572139280, now seen corresponding path program 1 times [2019-09-08 10:19:29,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:29,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:29,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:29,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:29,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:29,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:19:29,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:19:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:19:29,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:19:29,320 INFO L87 Difference]: Start difference. First operand 28308 states and 41697 transitions. Second operand 10 states. [2019-09-08 10:19:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:44,425 INFO L93 Difference]: Finished difference Result 150288 states and 220324 transitions. [2019-09-08 10:19:44,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:19:44,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:19:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:44,663 INFO L225 Difference]: With dead ends: 150288 [2019-09-08 10:19:44,664 INFO L226 Difference]: Without dead ends: 124067 [2019-09-08 10:19:44,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 10:19:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124067 states. [2019-09-08 10:19:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124067 to 28096. [2019-09-08 10:19:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28096 states. [2019-09-08 10:19:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28096 states to 28096 states and 41400 transitions. [2019-09-08 10:19:48,092 INFO L78 Accepts]: Start accepts. Automaton has 28096 states and 41400 transitions. Word has length 65 [2019-09-08 10:19:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:48,092 INFO L475 AbstractCegarLoop]: Abstraction has 28096 states and 41400 transitions. [2019-09-08 10:19:48,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:19:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28096 states and 41400 transitions. [2019-09-08 10:19:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:19:48,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:48,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:48,097 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2066882796, now seen corresponding path program 1 times [2019-09-08 10:19:48,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:48,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:48,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:48,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:19:48,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:19:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:19:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:19:48,340 INFO L87 Difference]: Start difference. First operand 28096 states and 41400 transitions. Second operand 10 states. [2019-09-08 10:20:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:03,906 INFO L93 Difference]: Finished difference Result 149671 states and 219502 transitions. [2019-09-08 10:20:03,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 10:20:03,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:20:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:05,723 INFO L225 Difference]: With dead ends: 149671 [2019-09-08 10:20:05,724 INFO L226 Difference]: Without dead ends: 123616 [2019-09-08 10:20:05,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:20:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123616 states. [2019-09-08 10:20:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123616 to 27843. [2019-09-08 10:20:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27843 states. [2019-09-08 10:20:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27843 states to 27843 states and 41007 transitions. [2019-09-08 10:20:09,469 INFO L78 Accepts]: Start accepts. Automaton has 27843 states and 41007 transitions. Word has length 65 [2019-09-08 10:20:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:09,469 INFO L475 AbstractCegarLoop]: Abstraction has 27843 states and 41007 transitions. [2019-09-08 10:20:09,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:20:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27843 states and 41007 transitions. [2019-09-08 10:20:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:20:09,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:09,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:09,473 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:09,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1389497554, now seen corresponding path program 1 times [2019-09-08 10:20:09,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:09,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:09,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:09,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:09,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:20:09,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:20:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:20:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:20:09,647 INFO L87 Difference]: Start difference. First operand 27843 states and 41007 transitions. Second operand 10 states. [2019-09-08 10:20:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:25,234 INFO L93 Difference]: Finished difference Result 126557 states and 183985 transitions. [2019-09-08 10:20:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:20:25,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:20:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:25,418 INFO L225 Difference]: With dead ends: 126557 [2019-09-08 10:20:25,418 INFO L226 Difference]: Without dead ends: 100353 [2019-09-08 10:20:25,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:20:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100353 states. [2019-09-08 10:20:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100353 to 27490. [2019-09-08 10:20:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-09-08 10:20:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 40478 transitions. [2019-09-08 10:20:29,590 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 40478 transitions. Word has length 65 [2019-09-08 10:20:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:29,590 INFO L475 AbstractCegarLoop]: Abstraction has 27490 states and 40478 transitions. [2019-09-08 10:20:29,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:20:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 40478 transitions. [2019-09-08 10:20:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:20:29,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:29,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:29,593 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash -376949161, now seen corresponding path program 1 times [2019-09-08 10:20:29,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:29,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:29,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:29,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:29,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:29,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:29,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:29,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:29,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:29,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:29,662 INFO L87 Difference]: Start difference. First operand 27490 states and 40478 transitions. Second operand 3 states. [2019-09-08 10:20:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:33,525 INFO L93 Difference]: Finished difference Result 40107 states and 58889 transitions. [2019-09-08 10:20:33,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:20:33,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:20:33,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:33,561 INFO L225 Difference]: With dead ends: 40107 [2019-09-08 10:20:33,561 INFO L226 Difference]: Without dead ends: 27465 [2019-09-08 10:20:33,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27465 states. [2019-09-08 10:20:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27465 to 27463. [2019-09-08 10:20:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27463 states. [2019-09-08 10:20:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27463 states to 27463 states and 39839 transitions. [2019-09-08 10:20:38,225 INFO L78 Accepts]: Start accepts. Automaton has 27463 states and 39839 transitions. Word has length 66 [2019-09-08 10:20:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:38,226 INFO L475 AbstractCegarLoop]: Abstraction has 27463 states and 39839 transitions. [2019-09-08 10:20:38,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:20:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 27463 states and 39839 transitions. [2019-09-08 10:20:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:20:38,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:38,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:38,229 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:38,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1749705359, now seen corresponding path program 1 times [2019-09-08 10:20:38,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:38,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:38,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:38,270 INFO L87 Difference]: Start difference. First operand 27463 states and 39839 transitions. Second operand 3 states. [2019-09-08 10:20:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:41,643 INFO L93 Difference]: Finished difference Result 37266 states and 53867 transitions. [2019-09-08 10:20:41,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:20:41,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:20:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:41,669 INFO L225 Difference]: With dead ends: 37266 [2019-09-08 10:20:41,669 INFO L226 Difference]: Without dead ends: 24660 [2019-09-08 10:20:41,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24660 states. [2019-09-08 10:20:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24660 to 24658. [2019-09-08 10:20:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24658 states. [2019-09-08 10:20:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24658 states to 24658 states and 35164 transitions. [2019-09-08 10:20:44,836 INFO L78 Accepts]: Start accepts. Automaton has 24658 states and 35164 transitions. Word has length 66 [2019-09-08 10:20:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:44,836 INFO L475 AbstractCegarLoop]: Abstraction has 24658 states and 35164 transitions. [2019-09-08 10:20:44,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:20:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 24658 states and 35164 transitions. [2019-09-08 10:20:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:20:44,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:44,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:44,840 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1710265917, now seen corresponding path program 1 times [2019-09-08 10:20:44,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:44,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:44,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:44,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:44,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:44,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:44,878 INFO L87 Difference]: Start difference. First operand 24658 states and 35164 transitions. Second operand 3 states. [2019-09-08 10:20:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:47,609 INFO L93 Difference]: Finished difference Result 30579 states and 43422 transitions. [2019-09-08 10:20:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:20:47,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:20:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:47,631 INFO L225 Difference]: With dead ends: 30579 [2019-09-08 10:20:47,631 INFO L226 Difference]: Without dead ends: 20871 [2019-09-08 10:20:47,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20871 states. [2019-09-08 10:20:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20871 to 20869. [2019-09-08 10:20:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20869 states. [2019-09-08 10:20:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20869 states to 20869 states and 29141 transitions. [2019-09-08 10:20:50,152 INFO L78 Accepts]: Start accepts. Automaton has 20869 states and 29141 transitions. Word has length 66 [2019-09-08 10:20:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:50,153 INFO L475 AbstractCegarLoop]: Abstraction has 20869 states and 29141 transitions. [2019-09-08 10:20:50,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:20:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20869 states and 29141 transitions. [2019-09-08 10:20:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:20:50,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:50,156 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:50,156 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:50,156 INFO L82 PathProgramCache]: Analyzing trace with hash -980051313, now seen corresponding path program 1 times [2019-09-08 10:20:50,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:50,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:50,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:50,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:50,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:50,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:50,188 INFO L87 Difference]: Start difference. First operand 20869 states and 29141 transitions. Second operand 3 states. [2019-09-08 10:20:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:54,290 INFO L93 Difference]: Finished difference Result 38973 states and 54563 transitions. [2019-09-08 10:20:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:20:54,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:20:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:54,326 INFO L225 Difference]: With dead ends: 38973 [2019-09-08 10:20:54,326 INFO L226 Difference]: Without dead ends: 31017 [2019-09-08 10:20:54,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31017 states. [2019-09-08 10:20:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31017 to 20603. [2019-09-08 10:20:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20603 states. [2019-09-08 10:20:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20603 states to 20603 states and 28732 transitions. [2019-09-08 10:20:57,309 INFO L78 Accepts]: Start accepts. Automaton has 20603 states and 28732 transitions. Word has length 67 [2019-09-08 10:20:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:57,309 INFO L475 AbstractCegarLoop]: Abstraction has 20603 states and 28732 transitions. [2019-09-08 10:20:57,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:20:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 20603 states and 28732 transitions. [2019-09-08 10:20:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:20:57,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:57,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:57,313 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash 732122448, now seen corresponding path program 1 times [2019-09-08 10:20:57,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:57,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:57,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:57,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:57,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:57,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:57,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:57,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:57,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:57,347 INFO L87 Difference]: Start difference. First operand 20603 states and 28732 transitions. Second operand 3 states. [2019-09-08 10:21:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:02,234 INFO L93 Difference]: Finished difference Result 38859 states and 54292 transitions. [2019-09-08 10:21:02,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:21:02,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:21:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:02,286 INFO L225 Difference]: With dead ends: 38859 [2019-09-08 10:21:02,286 INFO L226 Difference]: Without dead ends: 30869 [2019-09-08 10:21:02,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:21:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30869 states. [2019-09-08 10:21:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30869 to 20455. [2019-09-08 10:21:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20455 states. [2019-09-08 10:21:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20455 states to 20455 states and 28481 transitions. [2019-09-08 10:21:05,541 INFO L78 Accepts]: Start accepts. Automaton has 20455 states and 28481 transitions. Word has length 67 [2019-09-08 10:21:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:05,541 INFO L475 AbstractCegarLoop]: Abstraction has 20455 states and 28481 transitions. [2019-09-08 10:21:05,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:21:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20455 states and 28481 transitions. [2019-09-08 10:21:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:21:05,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:05,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:21:05,544 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash -261204545, now seen corresponding path program 1 times [2019-09-08 10:21:05,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:05,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:05,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:05,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:21:06,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:06,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:21:06,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:21:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:21:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:21:06,312 INFO L87 Difference]: Start difference. First operand 20455 states and 28481 transitions. Second operand 17 states. [2019-09-08 10:21:07,185 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 10:21:07,346 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:21:07,629 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 10:21:07,781 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:21:08,081 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:21:08,408 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 10:21:08,632 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:21:08,903 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:21:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:17,491 INFO L93 Difference]: Finished difference Result 40801 states and 56783 transitions. [2019-09-08 10:21:17,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:21:17,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-08 10:21:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:17,532 INFO L225 Difference]: With dead ends: 40801 [2019-09-08 10:21:17,532 INFO L226 Difference]: Without dead ends: 38865 [2019-09-08 10:21:17,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:21:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38865 states. [2019-09-08 10:21:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38865 to 20371. [2019-09-08 10:21:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20371 states. [2019-09-08 10:21:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20371 states to 20371 states and 28365 transitions. [2019-09-08 10:21:21,007 INFO L78 Accepts]: Start accepts. Automaton has 20371 states and 28365 transitions. Word has length 67 [2019-09-08 10:21:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:21,007 INFO L475 AbstractCegarLoop]: Abstraction has 20371 states and 28365 transitions. [2019-09-08 10:21:21,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:21:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 20371 states and 28365 transitions. [2019-09-08 10:21:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:21:21,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:21,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:21:21,010 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1834151963, now seen corresponding path program 1 times [2019-09-08 10:21:21,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:21:22,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:22,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 10:21:22,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 10:21:22,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 10:21:22,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:21:22,018 INFO L87 Difference]: Start difference. First operand 20371 states and 28365 transitions. Second operand 19 states. [2019-09-08 10:21:22,879 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 10:21:23,083 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 10:21:23,434 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-08 10:21:23,738 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-09-08 10:21:23,932 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 10:21:24,146 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 10:21:24,483 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 10:21:24,962 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 10:21:25,114 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-08 10:21:25,542 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 10:21:26,090 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 10:21:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:46,711 INFO L93 Difference]: Finished difference Result 95430 states and 133696 transitions. [2019-09-08 10:21:46,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 10:21:46,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-08 10:21:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:46,835 INFO L225 Difference]: With dead ends: 95430 [2019-09-08 10:21:46,835 INFO L226 Difference]: Without dead ends: 93545 [2019-09-08 10:21:46,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=472, Invalid=1690, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 10:21:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93545 states. [2019-09-08 10:21:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93545 to 20319. [2019-09-08 10:21:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20319 states. [2019-09-08 10:21:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20319 states to 20319 states and 28290 transitions. [2019-09-08 10:21:51,488 INFO L78 Accepts]: Start accepts. Automaton has 20319 states and 28290 transitions. Word has length 67 [2019-09-08 10:21:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:51,489 INFO L475 AbstractCegarLoop]: Abstraction has 20319 states and 28290 transitions. [2019-09-08 10:21:51,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 10:21:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20319 states and 28290 transitions. [2019-09-08 10:21:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:21:51,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:51,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:21:51,492 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1363022706, now seen corresponding path program 1 times [2019-09-08 10:21:51,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:21:51,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:51,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:21:51,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:21:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:21:51,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:21:51,524 INFO L87 Difference]: Start difference. First operand 20319 states and 28290 transitions. Second operand 3 states. [2019-09-08 10:21:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:56,799 INFO L93 Difference]: Finished difference Result 30966 states and 43091 transitions. [2019-09-08 10:21:56,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:21:56,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:21:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:56,824 INFO L225 Difference]: With dead ends: 30966 [2019-09-08 10:21:56,824 INFO L226 Difference]: Without dead ends: 24848 [2019-09-08 10:21:56,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:21:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24848 states. [2019-09-08 10:22:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24848 to 19787. [2019-09-08 10:22:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19787 states. [2019-09-08 10:22:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19787 states to 19787 states and 27542 transitions. [2019-09-08 10:22:00,847 INFO L78 Accepts]: Start accepts. Automaton has 19787 states and 27542 transitions. Word has length 67 [2019-09-08 10:22:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:00,847 INFO L475 AbstractCegarLoop]: Abstraction has 19787 states and 27542 transitions. [2019-09-08 10:22:00,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:22:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19787 states and 27542 transitions. [2019-09-08 10:22:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:22:00,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:00,849 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:22:00,850 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1412507135, now seen corresponding path program 1 times [2019-09-08 10:22:00,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:01,241 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-08 10:22:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:22:01,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:01,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:22:01,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:22:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:22:01,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:22:01,445 INFO L87 Difference]: Start difference. First operand 19787 states and 27542 transitions. Second operand 13 states. [2019-09-08 10:22:01,855 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-09-08 10:22:02,010 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 10:22:02,203 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 10:22:02,367 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 10:22:02,532 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 10:22:02,668 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 10:22:02,896 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-08 10:22:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:20,233 INFO L93 Difference]: Finished difference Result 74247 states and 103648 transitions. [2019-09-08 10:22:20,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:22:20,234 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-09-08 10:22:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:20,314 INFO L225 Difference]: With dead ends: 74247 [2019-09-08 10:22:20,314 INFO L226 Difference]: Without dead ends: 69702 [2019-09-08 10:22:20,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:22:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69702 states. [2019-09-08 10:22:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69702 to 19635. [2019-09-08 10:22:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19635 states. [2019-09-08 10:22:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19635 states to 19635 states and 27336 transitions. [2019-09-08 10:22:25,393 INFO L78 Accepts]: Start accepts. Automaton has 19635 states and 27336 transitions. Word has length 68 [2019-09-08 10:22:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:25,393 INFO L475 AbstractCegarLoop]: Abstraction has 19635 states and 27336 transitions. [2019-09-08 10:22:25,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:22:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 19635 states and 27336 transitions. [2019-09-08 10:22:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:22:25,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:25,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:22:25,397 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash -370961391, now seen corresponding path program 1 times [2019-09-08 10:22:25,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:25,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:22:25,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:25,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:22:25,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:22:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:22:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:22:25,478 INFO L87 Difference]: Start difference. First operand 19635 states and 27336 transitions. Second operand 5 states. [2019-09-08 10:22:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:30,149 INFO L93 Difference]: Finished difference Result 19641 states and 27339 transitions. [2019-09-08 10:22:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:22:30,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:22:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:30,169 INFO L225 Difference]: With dead ends: 19641 [2019-09-08 10:22:30,169 INFO L226 Difference]: Without dead ends: 18827 [2019-09-08 10:22:30,173 INFO L628 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-09-08 10:22:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18827 states. [2019-09-08 10:22:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18827 to 18823. [2019-09-08 10:22:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18823 states. [2019-09-08 10:22:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18823 states to 18823 states and 26243 transitions. [2019-09-08 10:22:34,667 INFO L78 Accepts]: Start accepts. Automaton has 18823 states and 26243 transitions. Word has length 71 [2019-09-08 10:22:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:34,667 INFO L475 AbstractCegarLoop]: Abstraction has 18823 states and 26243 transitions. [2019-09-08 10:22:34,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:22:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 18823 states and 26243 transitions. [2019-09-08 10:22:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:22:34,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:34,671 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:22:34,671 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1227529657, now seen corresponding path program 1 times [2019-09-08 10:22:34,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:34,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:34,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:34,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:22:34,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:34,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:22:34,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:22:34,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:22:34,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:22:34,759 INFO L87 Difference]: Start difference. First operand 18823 states and 26243 transitions. Second operand 6 states. [2019-09-08 10:22:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:44,599 INFO L93 Difference]: Finished difference Result 35950 states and 49348 transitions. [2019-09-08 10:22:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:22:44,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-08 10:22:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:44,637 INFO L225 Difference]: With dead ends: 35950 [2019-09-08 10:22:44,638 INFO L226 Difference]: Without dead ends: 35948 [2019-09-08 10:22:44,645 INFO L628 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-09-08 10:22:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35948 states. [2019-09-08 10:22:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35948 to 19453. [2019-09-08 10:22:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19453 states. [2019-09-08 10:22:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19453 states to 19453 states and 26703 transitions. [2019-09-08 10:22:49,689 INFO L78 Accepts]: Start accepts. Automaton has 19453 states and 26703 transitions. Word has length 74 [2019-09-08 10:22:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:49,689 INFO L475 AbstractCegarLoop]: Abstraction has 19453 states and 26703 transitions. [2019-09-08 10:22:49,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:22:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 19453 states and 26703 transitions. [2019-09-08 10:22:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:22:49,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:49,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:22:49,693 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1119890230, now seen corresponding path program 1 times [2019-09-08 10:22:49,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:49,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:49,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:49,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:49,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:22:49,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:49,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:22:49,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:22:49,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:22:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:22:49,733 INFO L87 Difference]: Start difference. First operand 19453 states and 26703 transitions. Second operand 3 states. [2019-09-08 10:22:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:58,899 INFO L93 Difference]: Finished difference Result 53369 states and 73329 transitions. [2019-09-08 10:22:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:22:58,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:22:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:58,942 INFO L225 Difference]: With dead ends: 53369 [2019-09-08 10:22:58,943 INFO L226 Difference]: Without dead ends: 34589 [2019-09-08 10:22:58,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:22:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34589 states. [2019-09-08 10:23:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34589 to 34167. [2019-09-08 10:23:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34167 states. [2019-09-08 10:23:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34167 states to 34167 states and 46197 transitions. [2019-09-08 10:23:08,070 INFO L78 Accepts]: Start accepts. Automaton has 34167 states and 46197 transitions. Word has length 75 [2019-09-08 10:23:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:08,071 INFO L475 AbstractCegarLoop]: Abstraction has 34167 states and 46197 transitions. [2019-09-08 10:23:08,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 34167 states and 46197 transitions. [2019-09-08 10:23:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:23:08,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:08,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:23:08,076 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash 22683295, now seen corresponding path program 1 times [2019-09-08 10:23:08,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:08,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:08,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:08,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:08,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:08,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:08,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:08,125 INFO L87 Difference]: Start difference. First operand 34167 states and 46197 transitions. Second operand 3 states. [2019-09-08 10:23:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:22,831 INFO L93 Difference]: Finished difference Result 86479 states and 116863 transitions. [2019-09-08 10:23:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:22,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:23:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:22,894 INFO L225 Difference]: With dead ends: 86479 [2019-09-08 10:23:22,894 INFO L226 Difference]: Without dead ends: 52955 [2019-09-08 10:23:22,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52955 states. [2019-09-08 10:23:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52955 to 48369. [2019-09-08 10:23:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48369 states. [2019-09-08 10:23:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48369 states to 48369 states and 64813 transitions. [2019-09-08 10:23:38,654 INFO L78 Accepts]: Start accepts. Automaton has 48369 states and 64813 transitions. Word has length 76 [2019-09-08 10:23:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:38,654 INFO L475 AbstractCegarLoop]: Abstraction has 48369 states and 64813 transitions. [2019-09-08 10:23:38,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 48369 states and 64813 transitions. [2019-09-08 10:23:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:23:38,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:38,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:23:38,659 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1396060808, now seen corresponding path program 1 times [2019-09-08 10:23:38,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:38,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:38,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:38,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:23:38,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:23:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:23:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:23:38,721 INFO L87 Difference]: Start difference. First operand 48369 states and 64813 transitions. Second operand 5 states. [2019-09-08 10:24:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:07,835 INFO L93 Difference]: Finished difference Result 151292 states and 201788 transitions. [2019-09-08 10:24:07,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:24:07,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 10:24:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:07,977 INFO L225 Difference]: With dead ends: 151292 [2019-09-08 10:24:07,977 INFO L226 Difference]: Without dead ends: 103479 [2019-09-08 10:24:08,018 INFO L628 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-09-08 10:24:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103479 states. [2019-09-08 10:24:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103479 to 54685. [2019-09-08 10:24:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54685 states. [2019-09-08 10:24:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54685 states to 54685 states and 71596 transitions. [2019-09-08 10:24:25,435 INFO L78 Accepts]: Start accepts. Automaton has 54685 states and 71596 transitions. Word has length 81 [2019-09-08 10:24:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:25,435 INFO L475 AbstractCegarLoop]: Abstraction has 54685 states and 71596 transitions. [2019-09-08 10:24:25,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:24:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 54685 states and 71596 transitions. [2019-09-08 10:24:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:24:25,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:25,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:24:25,440 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1228531457, now seen corresponding path program 1 times [2019-09-08 10:24:25,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:25,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:25,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:25,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:25,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:24:25,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:24:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:24:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:24:25,501 INFO L87 Difference]: Start difference. First operand 54685 states and 71596 transitions. Second operand 5 states. [2019-09-08 10:25:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:25:19,588 INFO L93 Difference]: Finished difference Result 238309 states and 310572 transitions. [2019-09-08 10:25:19,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:25:19,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 10:25:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:25:19,859 INFO L225 Difference]: With dead ends: 238309 [2019-09-08 10:25:19,860 INFO L226 Difference]: Without dead ends: 184255 [2019-09-08 10:25:19,936 INFO L628 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-09-08 10:25:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184255 states. [2019-09-08 10:25:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184255 to 108767. [2019-09-08 10:25:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108767 states. [2019-09-08 10:25:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108767 states to 108767 states and 142028 transitions. [2019-09-08 10:25:52,500 INFO L78 Accepts]: Start accepts. Automaton has 108767 states and 142028 transitions. Word has length 83 [2019-09-08 10:25:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:25:52,500 INFO L475 AbstractCegarLoop]: Abstraction has 108767 states and 142028 transitions. [2019-09-08 10:25:52,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:25:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 108767 states and 142028 transitions. [2019-09-08 10:25:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 10:25:52,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:25:52,513 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:25:52,513 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:25:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:25:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash -505184882, now seen corresponding path program 1 times [2019-09-08 10:25:52,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:25:52,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:25:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:52,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 10:25:52,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:25:52,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:25:52,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:25:52,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:25:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:25:52,576 INFO L87 Difference]: Start difference. First operand 108767 states and 142028 transitions. Second operand 3 states. [2019-09-08 10:26:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:22,963 INFO L93 Difference]: Finished difference Result 214319 states and 278494 transitions. [2019-09-08 10:26:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:26:22,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 10:26:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:23,104 INFO L225 Difference]: With dead ends: 214319 [2019-09-08 10:26:23,104 INFO L226 Difference]: Without dead ends: 106183 [2019-09-08 10:26:23,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106183 states. [2019-09-08 10:26:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106183 to 99801. [2019-09-08 10:26:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99801 states. [2019-09-08 10:26:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99801 states to 99801 states and 128148 transitions. [2019-09-08 10:26:53,306 INFO L78 Accepts]: Start accepts. Automaton has 99801 states and 128148 transitions. Word has length 94 [2019-09-08 10:26:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:53,306 INFO L475 AbstractCegarLoop]: Abstraction has 99801 states and 128148 transitions. [2019-09-08 10:26:53,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:26:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 99801 states and 128148 transitions. [2019-09-08 10:26:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 10:26:53,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:53,316 INFO L399 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] [2019-09-08 10:26:53,317 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:53,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1041325055, now seen corresponding path program 1 times [2019-09-08 10:26:53,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:53,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:53,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:26:53,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:53,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:26:53,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:26:53,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:26:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:53,370 INFO L87 Difference]: Start difference. First operand 99801 states and 128148 transitions. Second operand 3 states. [2019-09-08 10:27:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:47,553 INFO L93 Difference]: Finished difference Result 286997 states and 366626 transitions. [2019-09-08 10:27:47,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:47,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 10:27:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:47,790 INFO L225 Difference]: With dead ends: 286997 [2019-09-08 10:27:47,791 INFO L226 Difference]: Without dead ends: 187827 [2019-09-08 10:27:47,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187827 states. [2019-09-08 10:28:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187827 to 165005. [2019-09-08 10:28:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165005 states. [2019-09-08 10:28:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165005 states to 165005 states and 208720 transitions. [2019-09-08 10:28:37,728 INFO L78 Accepts]: Start accepts. Automaton has 165005 states and 208720 transitions. Word has length 95 [2019-09-08 10:28:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:37,729 INFO L475 AbstractCegarLoop]: Abstraction has 165005 states and 208720 transitions. [2019-09-08 10:28:37,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:28:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 165005 states and 208720 transitions. [2019-09-08 10:28:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:28:37,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:37,736 INFO L399 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] [2019-09-08 10:28:37,737 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2081371009, now seen corresponding path program 1 times [2019-09-08 10:28:37,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:37,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:37,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:37,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:37,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:28:37,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:28:37,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:38,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:28:38,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:28:38,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:28:38,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:28:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:39,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:28:39,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-09-08 10:28:39,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 10:28:39,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 10:28:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:28:39,255 INFO L87 Difference]: Start difference. First operand 165005 states and 208720 transitions. Second operand 19 states. [2019-09-08 10:28:39,780 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 10:28:39,919 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 10:28:42,602 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-08 10:28:44,806 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-09-08 10:28:45,338 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-08 10:28:45,820 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-08 10:28:53,278 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-08 10:31:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:48,332 INFO L93 Difference]: Finished difference Result 664422 states and 839509 transitions. [2019-09-08 10:31:48,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 10:31:48,332 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-09-08 10:31:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:49,482 INFO L225 Difference]: With dead ends: 664422 [2019-09-08 10:31:49,482 INFO L226 Difference]: Without dead ends: 573984 [2019-09-08 10:31:49,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=337, Invalid=1385, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 10:31:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573984 states.