java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:36:44,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:36:44,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:36:44,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:36:44,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:36:44,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:36:44,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:36:44,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:36:44,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:36:44,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:36:44,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:36:44,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:36:44,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:36:44,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:36:44,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:36:44,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:36:44,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:36:44,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:36:44,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:36:44,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:36:44,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:36:44,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:36:44,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:36:44,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:36:44,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:36:44,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:36:44,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:36:44,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:36:44,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:36:44,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:36:44,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:36:44,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:36:44,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:36:44,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:36:44,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:36:44,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:36:44,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:36:44,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:36:44,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:36:44,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:36:44,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:36:44,125 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:36:44,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:36:44,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:36:44,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:36:44,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:36:44,149 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:36:44,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:36:44,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:36:44,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:36:44,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:36:44,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:36:44,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:36:44,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:36:44,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:36:44,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:36:44,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:36:44,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:36:44,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:36:44,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:36:44,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:36:44,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:36:44,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:36:44,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:36:44,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:36:44,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:36:44,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:36:44,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:36:44,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:36:44,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:36:44,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:36:44,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:36:44,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:36:44,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:36:44,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:36:44,200 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:36:44,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-08 10:36:44,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79074560f/8738103c803a4ba0b56717e687606a57/FLAGaf60abd13 [2019-09-08 10:36:44,769 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:36:44,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-08 10:36:44,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79074560f/8738103c803a4ba0b56717e687606a57/FLAGaf60abd13 [2019-09-08 10:36:45,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79074560f/8738103c803a4ba0b56717e687606a57 [2019-09-08 10:36:45,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:36:45,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:36:45,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:36:45,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:36:45,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:36:45,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:36:45" (1/1) ... [2019-09-08 10:36:45,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c490221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:45, skipping insertion in model container [2019-09-08 10:36:45,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:36:45" (1/1) ... [2019-09-08 10:36:45,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:36:45,215 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:36:45,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:36:45,802 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:36:46,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:36:46,198 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:36:46,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46 WrapperNode [2019-09-08 10:36:46,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:36:46,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:36:46,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:36:46,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:36:46,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:36:46,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:36:46,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:36:46,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:36:46,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (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:36:46,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:36:46,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:36:46,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:36:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:36:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:36:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:36:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:36:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:36:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:36:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:36:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:36:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:36:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:36:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:36:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:36:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:36:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:36:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:36:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:36:47,919 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:36:47,919 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:36:47,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:36:47 BoogieIcfgContainer [2019-09-08 10:36:47,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:36:47,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:36:47,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:36:47,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:36:47,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:36:45" (1/3) ... [2019-09-08 10:36:47,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa203fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:36:47, skipping insertion in model container [2019-09-08 10:36:47,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (2/3) ... [2019-09-08 10:36:47,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa203fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:36:47, skipping insertion in model container [2019-09-08 10:36:47,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:36:47" (3/3) ... [2019-09-08 10:36:47,930 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-08 10:36:47,942 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:36:47,954 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:36:47,976 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:36:48,028 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:36:48,029 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:36:48,029 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:36:48,029 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:36:48,029 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:36:48,030 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:36:48,030 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:36:48,030 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:36:48,030 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:36:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-09-08 10:36:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 10:36:48,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:48,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:36:48,115 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash -718035537, now seen corresponding path program 1 times [2019-09-08 10:36:48,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:48,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:48,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:48,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:48,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:48,543 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:36:48,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:48,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:36:48,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:36:48,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:36:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:36:48,570 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 4 states. [2019-09-08 10:36:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:48,760 INFO L93 Difference]: Finished difference Result 832 states and 1346 transitions. [2019-09-08 10:36:48,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:36:48,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-08 10:36:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:48,781 INFO L225 Difference]: With dead ends: 832 [2019-09-08 10:36:48,781 INFO L226 Difference]: Without dead ends: 425 [2019-09-08 10:36:48,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:36:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-08 10:36:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2019-09-08 10:36:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-08 10:36:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 660 transitions. [2019-09-08 10:36:48,878 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 660 transitions. Word has length 111 [2019-09-08 10:36:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:48,879 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 660 transitions. [2019-09-08 10:36:48,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:36:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 660 transitions. [2019-09-08 10:36:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 10:36:48,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:48,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:36:48,889 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1172631640, now seen corresponding path program 1 times [2019-09-08 10:36:48,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:48,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:48,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:49,157 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:36:49,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:49,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:49,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:49,163 INFO L87 Difference]: Start difference. First operand 425 states and 660 transitions. Second operand 3 states. [2019-09-08 10:36:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:49,240 INFO L93 Difference]: Finished difference Result 1049 states and 1655 transitions. [2019-09-08 10:36:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:49,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-09-08 10:36:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:49,246 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 10:36:49,246 INFO L226 Difference]: Without dead ends: 669 [2019-09-08 10:36:49,250 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:36:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-09-08 10:36:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2019-09-08 10:36:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-09-08 10:36:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1042 transitions. [2019-09-08 10:36:49,314 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1042 transitions. Word has length 134 [2019-09-08 10:36:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:49,317 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 1042 transitions. [2019-09-08 10:36:49,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1042 transitions. [2019-09-08 10:36:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 10:36:49,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:49,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,321 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:49,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:49,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1255398106, now seen corresponding path program 1 times [2019-09-08 10:36:49,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:49,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:49,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:49,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:49,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:49,473 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:36:49,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:49,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:49,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:49,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:49,475 INFO L87 Difference]: Start difference. First operand 667 states and 1042 transitions. Second operand 3 states. [2019-09-08 10:36:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:49,553 INFO L93 Difference]: Finished difference Result 1683 states and 2656 transitions. [2019-09-08 10:36:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:49,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-08 10:36:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:49,560 INFO L225 Difference]: With dead ends: 1683 [2019-09-08 10:36:49,561 INFO L226 Difference]: Without dead ends: 1074 [2019-09-08 10:36:49,563 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:36:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-09-08 10:36:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1072. [2019-09-08 10:36:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-09-08 10:36:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1677 transitions. [2019-09-08 10:36:49,610 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1677 transitions. Word has length 137 [2019-09-08 10:36:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:49,610 INFO L475 AbstractCegarLoop]: Abstraction has 1072 states and 1677 transitions. [2019-09-08 10:36:49,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1677 transitions. [2019-09-08 10:36:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 10:36:49,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:49,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,615 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:49,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1981911143, now seen corresponding path program 1 times [2019-09-08 10:36:49,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:49,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:49,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:49,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:49,750 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:36:49,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:49,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:49,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:49,752 INFO L87 Difference]: Start difference. First operand 1072 states and 1677 transitions. Second operand 3 states. [2019-09-08 10:36:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:49,871 INFO L93 Difference]: Finished difference Result 2722 states and 4280 transitions. [2019-09-08 10:36:49,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:49,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 10:36:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:49,883 INFO L225 Difference]: With dead ends: 2722 [2019-09-08 10:36:49,884 INFO L226 Difference]: Without dead ends: 1721 [2019-09-08 10:36:49,887 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:36:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-09-08 10:36:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2019-09-08 10:36:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-09-08 10:36:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2679 transitions. [2019-09-08 10:36:49,970 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2679 transitions. Word has length 140 [2019-09-08 10:36:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:49,971 INFO L475 AbstractCegarLoop]: Abstraction has 1719 states and 2679 transitions. [2019-09-08 10:36:49,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2679 transitions. [2019-09-08 10:36:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 10:36:49,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:49,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,977 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1296832615, now seen corresponding path program 1 times [2019-09-08 10:36:49,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:49,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:50,083 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:36:50,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:50,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:50,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:50,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:50,086 INFO L87 Difference]: Start difference. First operand 1719 states and 2679 transitions. Second operand 3 states. [2019-09-08 10:36:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:50,246 INFO L93 Difference]: Finished difference Result 4319 states and 6733 transitions. [2019-09-08 10:36:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:50,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 10:36:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:50,266 INFO L225 Difference]: With dead ends: 4319 [2019-09-08 10:36:50,266 INFO L226 Difference]: Without dead ends: 2684 [2019-09-08 10:36:50,271 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:36:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-09-08 10:36:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2682. [2019-09-08 10:36:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-09-08 10:36:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 4137 transitions. [2019-09-08 10:36:50,460 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 4137 transitions. Word has length 143 [2019-09-08 10:36:50,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:50,462 INFO L475 AbstractCegarLoop]: Abstraction has 2682 states and 4137 transitions. [2019-09-08 10:36:50,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 4137 transitions. [2019-09-08 10:36:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 10:36:50,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:50,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:50,473 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2024634528, now seen corresponding path program 1 times [2019-09-08 10:36:50,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:50,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:50,583 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:36:50,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:50,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:36:50,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:36:50,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:36:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:36:50,585 INFO L87 Difference]: Start difference. First operand 2682 states and 4137 transitions. Second operand 6 states. [2019-09-08 10:36:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:51,630 INFO L93 Difference]: Finished difference Result 14021 states and 21623 transitions. [2019-09-08 10:36:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:36:51,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-09-08 10:36:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:51,686 INFO L225 Difference]: With dead ends: 14021 [2019-09-08 10:36:51,686 INFO L226 Difference]: Without dead ends: 11427 [2019-09-08 10:36:51,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:36:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11427 states. [2019-09-08 10:36:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11427 to 5192. [2019-09-08 10:36:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5192 states. [2019-09-08 10:36:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 7894 transitions. [2019-09-08 10:36:52,065 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 7894 transitions. Word has length 146 [2019-09-08 10:36:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:52,067 INFO L475 AbstractCegarLoop]: Abstraction has 5192 states and 7894 transitions. [2019-09-08 10:36:52,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:36:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 7894 transitions. [2019-09-08 10:36:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 10:36:52,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:52,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:52,083 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash -84299595, now seen corresponding path program 1 times [2019-09-08 10:36:52,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:52,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:52,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:52,190 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:36:52,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:52,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:52,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:52,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:52,193 INFO L87 Difference]: Start difference. First operand 5192 states and 7894 transitions. Second operand 3 states. [2019-09-08 10:36:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:52,727 INFO L93 Difference]: Finished difference Result 14827 states and 22512 transitions. [2019-09-08 10:36:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:52,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 10:36:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:52,772 INFO L225 Difference]: With dead ends: 14827 [2019-09-08 10:36:52,772 INFO L226 Difference]: Without dead ends: 9735 [2019-09-08 10:36:52,785 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:36:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2019-09-08 10:36:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2019-09-08 10:36:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9733 states. [2019-09-08 10:36:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14653 transitions. [2019-09-08 10:36:53,358 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14653 transitions. Word has length 150 [2019-09-08 10:36:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:53,359 INFO L475 AbstractCegarLoop]: Abstraction has 9733 states and 14653 transitions. [2019-09-08 10:36:53,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14653 transitions. [2019-09-08 10:36:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 10:36:53,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:53,389 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:53,390 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1868339546, now seen corresponding path program 1 times [2019-09-08 10:36:53,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:53,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:53,487 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:36:53,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:53,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:53,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:53,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:53,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:53,489 INFO L87 Difference]: Start difference. First operand 9733 states and 14653 transitions. Second operand 3 states. [2019-09-08 10:36:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:54,282 INFO L93 Difference]: Finished difference Result 26879 states and 40243 transitions. [2019-09-08 10:36:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:54,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 10:36:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:54,324 INFO L225 Difference]: With dead ends: 26879 [2019-09-08 10:36:54,325 INFO L226 Difference]: Without dead ends: 17928 [2019-09-08 10:36:54,346 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:36:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17928 states. [2019-09-08 10:36:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17928 to 17926. [2019-09-08 10:36:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17926 states. [2019-09-08 10:36:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17926 states to 17926 states and 26579 transitions. [2019-09-08 10:36:55,753 INFO L78 Accepts]: Start accepts. Automaton has 17926 states and 26579 transitions. Word has length 150 [2019-09-08 10:36:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:55,754 INFO L475 AbstractCegarLoop]: Abstraction has 17926 states and 26579 transitions. [2019-09-08 10:36:55,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17926 states and 26579 transitions. [2019-09-08 10:36:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 10:36:55,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:55,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:55,796 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1275894777, now seen corresponding path program 1 times [2019-09-08 10:36:55,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:55,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:55,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:36:55,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:55,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:55,877 INFO L87 Difference]: Start difference. First operand 17926 states and 26579 transitions. Second operand 3 states. [2019-09-08 10:36:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:56,974 INFO L93 Difference]: Finished difference Result 50444 states and 74381 transitions. [2019-09-08 10:36:56,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:56,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 10:36:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:57,049 INFO L225 Difference]: With dead ends: 50444 [2019-09-08 10:36:57,049 INFO L226 Difference]: Without dead ends: 33166 [2019-09-08 10:36:57,098 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:36:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33166 states. [2019-09-08 10:36:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33166 to 33164. [2019-09-08 10:36:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33164 states. [2019-09-08 10:36:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33164 states to 33164 states and 48377 transitions. [2019-09-08 10:36:59,198 INFO L78 Accepts]: Start accepts. Automaton has 33164 states and 48377 transitions. Word has length 150 [2019-09-08 10:36:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:59,198 INFO L475 AbstractCegarLoop]: Abstraction has 33164 states and 48377 transitions. [2019-09-08 10:36:59,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33164 states and 48377 transitions. [2019-09-08 10:36:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 10:36:59,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:59,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,273 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:59,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash -185662702, now seen corresponding path program 1 times [2019-09-08 10:36:59,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:59,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:59,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:59,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:59,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:59,366 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:36:59,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:59,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:59,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:59,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:59,368 INFO L87 Difference]: Start difference. First operand 33164 states and 48377 transitions. Second operand 3 states. [2019-09-08 10:37:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:01,095 INFO L93 Difference]: Finished difference Result 93728 states and 135906 transitions. [2019-09-08 10:37:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 10:37:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:01,240 INFO L225 Difference]: With dead ends: 93728 [2019-09-08 10:37:01,241 INFO L226 Difference]: Without dead ends: 61072 [2019-09-08 10:37:01,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61072 states. [2019-09-08 10:37:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61072 to 61070. [2019-09-08 10:37:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61070 states. [2019-09-08 10:37:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61070 states to 61070 states and 87500 transitions. [2019-09-08 10:37:04,894 INFO L78 Accepts]: Start accepts. Automaton has 61070 states and 87500 transitions. Word has length 150 [2019-09-08 10:37:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:04,895 INFO L475 AbstractCegarLoop]: Abstraction has 61070 states and 87500 transitions. [2019-09-08 10:37:04,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 61070 states and 87500 transitions. [2019-09-08 10:37:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 10:37:04,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:04,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:04,967 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1973566562, now seen corresponding path program 1 times [2019-09-08 10:37:04,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:04,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:04,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:05,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:05,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:05,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:05,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:05,274 INFO L87 Difference]: Start difference. First operand 61070 states and 87500 transitions. Second operand 6 states. [2019-09-08 10:37:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:08,444 INFO L93 Difference]: Finished difference Result 74414 states and 105766 transitions. [2019-09-08 10:37:08,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:37:08,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-08 10:37:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:08,543 INFO L225 Difference]: With dead ends: 74414 [2019-09-08 10:37:08,544 INFO L226 Difference]: Without dead ends: 67928 [2019-09-08 10:37:08,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67928 states. [2019-09-08 10:37:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67928 to 61613. [2019-09-08 10:37:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61613 states. [2019-09-08 10:37:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61613 states to 61613 states and 88134 transitions. [2019-09-08 10:37:12,038 INFO L78 Accepts]: Start accepts. Automaton has 61613 states and 88134 transitions. Word has length 151 [2019-09-08 10:37:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:12,038 INFO L475 AbstractCegarLoop]: Abstraction has 61613 states and 88134 transitions. [2019-09-08 10:37:12,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 61613 states and 88134 transitions. [2019-09-08 10:37:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 10:37:12,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:12,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:12,093 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -472115874, now seen corresponding path program 1 times [2019-09-08 10:37:12,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:12,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:12,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:12,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:12,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:12,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:12,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:12,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:12,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:12,202 INFO L87 Difference]: Start difference. First operand 61613 states and 88134 transitions. Second operand 3 states. [2019-09-08 10:37:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:14,035 INFO L93 Difference]: Finished difference Result 88540 states and 126177 transitions. [2019-09-08 10:37:14,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:14,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 10:37:14,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:14,099 INFO L225 Difference]: With dead ends: 88540 [2019-09-08 10:37:14,099 INFO L226 Difference]: Without dead ends: 58284 [2019-09-08 10:37:14,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58284 states. [2019-09-08 10:37:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58284 to 58282. [2019-09-08 10:37:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58282 states. [2019-09-08 10:37:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58282 states to 58282 states and 82678 transitions. [2019-09-08 10:37:16,297 INFO L78 Accepts]: Start accepts. Automaton has 58282 states and 82678 transitions. Word has length 152 [2019-09-08 10:37:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:16,298 INFO L475 AbstractCegarLoop]: Abstraction has 58282 states and 82678 transitions. [2019-09-08 10:37:16,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 58282 states and 82678 transitions. [2019-09-08 10:37:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 10:37:16,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:16,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:16,365 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash -415740174, now seen corresponding path program 1 times [2019-09-08 10:37:16,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:16,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:17,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:17,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:17,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:17,949 INFO L87 Difference]: Start difference. First operand 58282 states and 82678 transitions. Second operand 3 states. [2019-09-08 10:37:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:19,540 INFO L93 Difference]: Finished difference Result 84228 states and 119002 transitions. [2019-09-08 10:37:19,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:19,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 10:37:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:19,605 INFO L225 Difference]: With dead ends: 84228 [2019-09-08 10:37:19,605 INFO L226 Difference]: Without dead ends: 57284 [2019-09-08 10:37:19,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57284 states. [2019-09-08 10:37:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57284 to 57282. [2019-09-08 10:37:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57282 states. [2019-09-08 10:37:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57282 states to 57282 states and 80532 transitions. [2019-09-08 10:37:21,682 INFO L78 Accepts]: Start accepts. Automaton has 57282 states and 80532 transitions. Word has length 154 [2019-09-08 10:37:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:21,682 INFO L475 AbstractCegarLoop]: Abstraction has 57282 states and 80532 transitions. [2019-09-08 10:37:21,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57282 states and 80532 transitions. [2019-09-08 10:37:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 10:37:21,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:21,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:21,741 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1753293239, now seen corresponding path program 1 times [2019-09-08 10:37:21,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:21,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:21,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:22,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:22,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:22,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:22,063 INFO L87 Difference]: Start difference. First operand 57282 states and 80532 transitions. Second operand 3 states. [2019-09-08 10:37:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:23,659 INFO L93 Difference]: Finished difference Result 82936 states and 116096 transitions. [2019-09-08 10:37:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:23,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 10:37:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:23,723 INFO L225 Difference]: With dead ends: 82936 [2019-09-08 10:37:23,723 INFO L226 Difference]: Without dead ends: 57204 [2019-09-08 10:37:23,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57204 states. [2019-09-08 10:37:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57204 to 57202. [2019-09-08 10:37:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57202 states. [2019-09-08 10:37:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57202 states to 57202 states and 79646 transitions. [2019-09-08 10:37:26,078 INFO L78 Accepts]: Start accepts. Automaton has 57202 states and 79646 transitions. Word has length 154 [2019-09-08 10:37:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:26,078 INFO L475 AbstractCegarLoop]: Abstraction has 57202 states and 79646 transitions. [2019-09-08 10:37:26,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 57202 states and 79646 transitions. [2019-09-08 10:37:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:37:26,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:26,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:26,132 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash -801073396, now seen corresponding path program 1 times [2019-09-08 10:37:26,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:26,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:26,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:26,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:26,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:26,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:26,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:37:26,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:37:26,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:37:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:26,237 INFO L87 Difference]: Start difference. First operand 57202 states and 79646 transitions. Second operand 5 states. [2019-09-08 10:37:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:31,325 INFO L93 Difference]: Finished difference Result 165372 states and 229963 transitions. [2019-09-08 10:37:31,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:31,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-08 10:37:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:31,440 INFO L225 Difference]: With dead ends: 165372 [2019-09-08 10:37:31,441 INFO L226 Difference]: Without dead ends: 108210 [2019-09-08 10:37:31,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:37:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108210 states. [2019-09-08 10:37:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108210 to 107984. [2019-09-08 10:37:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107984 states. [2019-09-08 10:37:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107984 states to 107984 states and 149420 transitions. [2019-09-08 10:37:37,838 INFO L78 Accepts]: Start accepts. Automaton has 107984 states and 149420 transitions. Word has length 156 [2019-09-08 10:37:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:37,839 INFO L475 AbstractCegarLoop]: Abstraction has 107984 states and 149420 transitions. [2019-09-08 10:37:37,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:37:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 107984 states and 149420 transitions. [2019-09-08 10:37:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:37:37,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:37,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:37,959 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 822620583, now seen corresponding path program 1 times [2019-09-08 10:37:37,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:37,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:37,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:38,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:38,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:37:38,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:37:38,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:37:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:37:38,132 INFO L87 Difference]: Start difference. First operand 107984 states and 149420 transitions. Second operand 7 states. [2019-09-08 10:37:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:50,929 INFO L93 Difference]: Finished difference Result 248482 states and 341534 transitions. [2019-09-08 10:37:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:37:50,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-08 10:37:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:51,199 INFO L225 Difference]: With dead ends: 248482 [2019-09-08 10:37:51,200 INFO L226 Difference]: Without dead ends: 229740 [2019-09-08 10:37:51,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:37:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229740 states. [2019-09-08 10:37:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229740 to 108036. [2019-09-08 10:37:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108036 states. [2019-09-08 10:37:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108036 states to 108036 states and 149484 transitions. [2019-09-08 10:37:58,014 INFO L78 Accepts]: Start accepts. Automaton has 108036 states and 149484 transitions. Word has length 156 [2019-09-08 10:37:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:58,014 INFO L475 AbstractCegarLoop]: Abstraction has 108036 states and 149484 transitions. [2019-09-08 10:37:58,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:37:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 108036 states and 149484 transitions. [2019-09-08 10:37:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:37:58,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:58,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:58,108 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2091961504, now seen corresponding path program 1 times [2019-09-08 10:37:58,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:58,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:58,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:58,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:58,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:58,206 INFO L87 Difference]: Start difference. First operand 108036 states and 149484 transitions. Second operand 3 states. [2019-09-08 10:38:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:11,471 INFO L93 Difference]: Finished difference Result 313061 states and 432677 transitions. [2019-09-08 10:38:11,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:38:11,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 10:38:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:11,731 INFO L225 Difference]: With dead ends: 313061 [2019-09-08 10:38:11,731 INFO L226 Difference]: Without dead ends: 214557 [2019-09-08 10:38:11,992 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:38:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214557 states. [2019-09-08 10:38:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214557 to 213898. [2019-09-08 10:38:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213898 states. [2019-09-08 10:38:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213898 states to 213898 states and 293873 transitions. [2019-09-08 10:38:24,285 INFO L78 Accepts]: Start accepts. Automaton has 213898 states and 293873 transitions. Word has length 156 [2019-09-08 10:38:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:24,285 INFO L475 AbstractCegarLoop]: Abstraction has 213898 states and 293873 transitions. [2019-09-08 10:38:24,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:38:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 213898 states and 293873 transitions. [2019-09-08 10:38:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:38:24,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:24,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:38:24,489 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -43501509, now seen corresponding path program 1 times [2019-09-08 10:38:24,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:24,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:24,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:24,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:38:24,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:38:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:38:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:38:24,609 INFO L87 Difference]: Start difference. First operand 213898 states and 293873 transitions. Second operand 6 states. [2019-09-08 10:38:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:40,863 INFO L93 Difference]: Finished difference Result 470433 states and 646310 transitions. [2019-09-08 10:38:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:38:40,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-09-08 10:38:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:41,581 INFO L225 Difference]: With dead ends: 470433 [2019-09-08 10:38:41,581 INFO L226 Difference]: Without dead ends: 268835 [2019-09-08 10:38:41,712 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:38:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268835 states. [2019-09-08 10:38:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268835 to 267939. [2019-09-08 10:38:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267939 states. [2019-09-08 10:39:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267939 states to 267939 states and 367417 transitions. [2019-09-08 10:39:01,044 INFO L78 Accepts]: Start accepts. Automaton has 267939 states and 367417 transitions. Word has length 156 [2019-09-08 10:39:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:01,044 INFO L475 AbstractCegarLoop]: Abstraction has 267939 states and 367417 transitions. [2019-09-08 10:39:01,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:39:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 267939 states and 367417 transitions. [2019-09-08 10:39:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:39:01,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:01,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:39:01,365 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -873781056, now seen corresponding path program 1 times [2019-09-08 10:39:01,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:01,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:01,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:01,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:01,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:39:01,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:39:01,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:39:01,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:39:01,484 INFO L87 Difference]: Start difference. First operand 267939 states and 367417 transitions. Second operand 7 states. [2019-09-08 10:39:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:46,658 INFO L93 Difference]: Finished difference Result 729696 states and 992707 transitions. [2019-09-08 10:39:46,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:39:46,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-08 10:39:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:47,517 INFO L225 Difference]: With dead ends: 729696 [2019-09-08 10:39:47,518 INFO L226 Difference]: Without dead ends: 680388 [2019-09-08 10:39:47,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:39:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680388 states. [2019-09-08 10:40:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680388 to 268138. [2019-09-08 10:40:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268138 states. [2019-09-08 10:40:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268138 states to 268138 states and 367680 transitions. [2019-09-08 10:40:15,758 INFO L78 Accepts]: Start accepts. Automaton has 268138 states and 367680 transitions. Word has length 156 [2019-09-08 10:40:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:15,759 INFO L475 AbstractCegarLoop]: Abstraction has 268138 states and 367680 transitions. [2019-09-08 10:40:15,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:40:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 268138 states and 367680 transitions. [2019-09-08 10:40:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:40:16,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:16,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:16,012 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1822023326, now seen corresponding path program 1 times [2019-09-08 10:40:16,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:16,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:16,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:16,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:40:16,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:40:16,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:40:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:40:16,142 INFO L87 Difference]: Start difference. First operand 268138 states and 367680 transitions. Second operand 6 states. [2019-09-08 10:40:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:56,948 INFO L93 Difference]: Finished difference Result 855194 states and 1169767 transitions. [2019-09-08 10:40:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:40:56,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-09-08 10:40:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:57,830 INFO L225 Difference]: With dead ends: 855194 [2019-09-08 10:40:57,830 INFO L226 Difference]: Without dead ends: 587179 [2019-09-08 10:40:58,907 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:40:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587179 states. [2019-09-08 10:41:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587179 to 584479. [2019-09-08 10:41:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584479 states. [2019-09-08 10:41:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584479 states to 584479 states and 795433 transitions. [2019-09-08 10:41:54,845 INFO L78 Accepts]: Start accepts. Automaton has 584479 states and 795433 transitions. Word has length 156 [2019-09-08 10:41:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:54,846 INFO L475 AbstractCegarLoop]: Abstraction has 584479 states and 795433 transitions. [2019-09-08 10:41:54,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:41:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 584479 states and 795433 transitions. [2019-09-08 10:41:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:41:55,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:55,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:55,482 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1384854969, now seen corresponding path program 1 times [2019-09-08 10:41:55,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:55,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:55,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:55,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:55,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:55,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:41:55,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:41:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:41:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:41:55,597 INFO L87 Difference]: Start difference. First operand 584479 states and 795433 transitions. Second operand 7 states. [2019-09-08 10:43:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:48,593 INFO L93 Difference]: Finished difference Result 1458854 states and 1972259 transitions. [2019-09-08 10:43:48,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:43:48,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-08 10:43:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:50,538 INFO L225 Difference]: With dead ends: 1458854 [2019-09-08 10:43:50,538 INFO L226 Difference]: Without dead ends: 1328806 [2019-09-08 10:43:50,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:43:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328806 states. [2019-09-08 10:45:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328806 to 585052. [2019-09-08 10:45:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585052 states. [2019-09-08 10:45:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585052 states to 585052 states and 796187 transitions. [2019-09-08 10:45:09,789 INFO L78 Accepts]: Start accepts. Automaton has 585052 states and 796187 transitions. Word has length 156 [2019-09-08 10:45:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:09,789 INFO L475 AbstractCegarLoop]: Abstraction has 585052 states and 796187 transitions. [2019-09-08 10:45:09,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:45:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 585052 states and 796187 transitions. [2019-09-08 10:45:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 10:45:10,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:10,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:10,424 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:10,424 INFO L82 PathProgramCache]: Analyzing trace with hash 521371508, now seen corresponding path program 1 times [2019-09-08 10:45:10,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:10,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:10,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:10,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:10,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:10,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:10,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:10,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:10,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:10,508 INFO L87 Difference]: Start difference. First operand 585052 states and 796187 transitions. Second operand 3 states. [2019-09-08 10:46:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:59,250 INFO L93 Difference]: Finished difference Result 1699375 states and 2308044 transitions. [2019-09-08 10:46:59,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:46:59,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 10:46:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:01,515 INFO L225 Difference]: With dead ends: 1699375 [2019-09-08 10:47:01,515 INFO L226 Difference]: Without dead ends: 1159516 [2019-09-08 10:47:01,962 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:47:02,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159516 states.