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.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:15:31,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:15:31,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:15:31,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:15:31,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:15:31,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:15:31,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:15:31,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:15:31,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:15:31,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:15:31,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:15:31,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:15:31,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:15:31,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:15:31,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:15:31,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:15:31,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:15:31,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:15:31,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:15:31,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:15:31,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:15:31,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:15:31,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:15:31,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:15:31,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:15:31,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:15:31,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:15:31,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:15:31,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:15:31,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:15:31,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:15:31,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:15:31,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:15:31,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:15:31,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:15:31,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:15:31,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:15:31,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:15:31,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:15:31,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:15:31,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:15:31,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:15:31,180 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:15:31,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:15:31,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:15:31,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:15:31,181 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:15:31,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:15:31,182 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:15:31,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:15:31,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:15:31,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:15:31,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:15:31,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:15:31,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:15:31,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:15:31,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:15:31,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:15:31,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:15:31,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:15:31,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:15:31,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:15:31,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:15:31,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:15:31,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:15:31,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:15:31,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:15:31,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:15:31,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:15:31,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:15:31,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:15:31,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:15:31,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:15:31,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:15:31,243 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:15:31,245 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:15:31,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 12:15:31,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7039d0cf/c9fab108fd3b42cb9eb8f50b4a0f56dd/FLAG4febab27b [2019-09-08 12:15:31,889 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:15:31,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 12:15:31,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7039d0cf/c9fab108fd3b42cb9eb8f50b4a0f56dd/FLAG4febab27b [2019-09-08 12:15:32,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7039d0cf/c9fab108fd3b42cb9eb8f50b4a0f56dd [2019-09-08 12:15:32,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:15:32,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:15:32,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:15:32,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:15:32,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:15:32,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:15:32" (1/1) ... [2019-09-08 12:15:32,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e21f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:32, skipping insertion in model container [2019-09-08 12:15:32,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:15:32" (1/1) ... [2019-09-08 12:15:32,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:15:32,211 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:15:32,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:15:32,822 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:15:33,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:15:33,247 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:15:33,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33 WrapperNode [2019-09-08 12:15:33,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:15:33,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:15:33,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:15:33,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:15:33,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... [2019-09-08 12:15:33,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... [2019-09-08 12:15:33,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... [2019-09-08 12:15:33,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... [2019-09-08 12:15:33,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... [2019-09-08 12:15:33,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... [2019-09-08 12:15:33,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... [2019-09-08 12:15:33,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:15:33,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:15:33,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:15:33,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:15:33,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:15:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:15:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:15:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:15:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:15:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:15:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:15:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:15:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:15:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:15:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:15:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:15:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:15:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:15:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:15:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:15:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:15:33,440 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:15:33,440 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:15:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:15:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:15:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:15:35,181 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:15:35,181 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:15:35,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:15:35 BoogieIcfgContainer [2019-09-08 12:15:35,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:15:35,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:15:35,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:15:35,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:15:35,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:15:32" (1/3) ... [2019-09-08 12:15:35,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5571b23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:15:35, skipping insertion in model container [2019-09-08 12:15:35,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:15:33" (2/3) ... [2019-09-08 12:15:35,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5571b23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:15:35, skipping insertion in model container [2019-09-08 12:15:35,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:15:35" (3/3) ... [2019-09-08 12:15:35,196 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 12:15:35,207 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:15:35,232 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:15:35,256 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:15:35,306 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:15:35,307 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:15:35,307 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:15:35,307 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:15:35,307 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:15:35,308 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:15:35,308 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:15:35,308 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:15:35,308 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:15:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states. [2019-09-08 12:15:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:15:35,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:35,363 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 12:15:35,365 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash 266849754, now seen corresponding path program 1 times [2019-09-08 12:15:35,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:35,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:35,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:35,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:35,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:15:35,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:15:35,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:15:35,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:15:35,867 INFO L87 Difference]: Start difference. First operand 395 states. Second operand 4 states. [2019-09-08 12:15:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:36,128 INFO L93 Difference]: Finished difference Result 748 states and 1218 transitions. [2019-09-08 12:15:36,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:15:36,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 12:15:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:36,157 INFO L225 Difference]: With dead ends: 748 [2019-09-08 12:15:36,157 INFO L226 Difference]: Without dead ends: 391 [2019-09-08 12:15:36,170 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 12:15:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-08 12:15:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2019-09-08 12:15:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-08 12:15:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 596 transitions. [2019-09-08 12:15:36,305 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 596 transitions. Word has length 151 [2019-09-08 12:15:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:36,306 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 596 transitions. [2019-09-08 12:15:36,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:15:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 596 transitions. [2019-09-08 12:15:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 12:15:36,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:36,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:36,319 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -286354186, now seen corresponding path program 1 times [2019-09-08 12:15:36,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:36,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:36,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:36,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:36,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:36,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:36,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:36,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:36,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:36,625 INFO L87 Difference]: Start difference. First operand 391 states and 596 transitions. Second operand 3 states. [2019-09-08 12:15:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:36,750 INFO L93 Difference]: Finished difference Result 965 states and 1512 transitions. [2019-09-08 12:15:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:36,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-08 12:15:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:36,757 INFO L225 Difference]: With dead ends: 965 [2019-09-08 12:15:36,758 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 12:15:36,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 12:15:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-09-08 12:15:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 12:15:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 968 transitions. [2019-09-08 12:15:36,807 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 968 transitions. Word has length 190 [2019-09-08 12:15:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:36,810 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 968 transitions. [2019-09-08 12:15:36,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 968 transitions. [2019-09-08 12:15:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 12:15:36,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:36,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:36,815 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1628621540, now seen corresponding path program 1 times [2019-09-08 12:15:36,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:36,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:36,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:37,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:37,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:37,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:37,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:37,027 INFO L87 Difference]: Start difference. First operand 626 states and 968 transitions. Second operand 3 states. [2019-09-08 12:15:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:37,140 INFO L93 Difference]: Finished difference Result 1624 states and 2557 transitions. [2019-09-08 12:15:37,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:37,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-08 12:15:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:37,150 INFO L225 Difference]: With dead ends: 1624 [2019-09-08 12:15:37,150 INFO L226 Difference]: Without dead ends: 1058 [2019-09-08 12:15:37,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-09-08 12:15:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2019-09-08 12:15:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-09-08 12:15:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1646 transitions. [2019-09-08 12:15:37,207 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1646 transitions. Word has length 193 [2019-09-08 12:15:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:37,208 INFO L475 AbstractCegarLoop]: Abstraction has 1056 states and 1646 transitions. [2019-09-08 12:15:37,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1646 transitions. [2019-09-08 12:15:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 12:15:37,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:37,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:37,217 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:37,217 INFO L82 PathProgramCache]: Analyzing trace with hash 981722112, now seen corresponding path program 1 times [2019-09-08 12:15:37,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:37,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:37,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:37,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:37,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:37,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:37,421 INFO L87 Difference]: Start difference. First operand 1056 states and 1646 transitions. Second operand 3 states. [2019-09-08 12:15:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:37,588 INFO L93 Difference]: Finished difference Result 2824 states and 4449 transitions. [2019-09-08 12:15:37,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:37,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 12:15:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:37,604 INFO L225 Difference]: With dead ends: 2824 [2019-09-08 12:15:37,605 INFO L226 Difference]: Without dead ends: 1834 [2019-09-08 12:15:37,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-09-08 12:15:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1832. [2019-09-08 12:15:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2019-09-08 12:15:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2862 transitions. [2019-09-08 12:15:37,711 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2862 transitions. Word has length 196 [2019-09-08 12:15:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:37,712 INFO L475 AbstractCegarLoop]: Abstraction has 1832 states and 2862 transitions. [2019-09-08 12:15:37,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2862 transitions. [2019-09-08 12:15:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 12:15:37,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:37,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:37,720 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1479581457, now seen corresponding path program 1 times [2019-09-08 12:15:37,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:37,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:37,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:37,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:37,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:37,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:37,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:37,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:37,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:37,857 INFO L87 Difference]: Start difference. First operand 1832 states and 2862 transitions. Second operand 3 states. [2019-09-08 12:15:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:38,042 INFO L93 Difference]: Finished difference Result 4974 states and 7813 transitions. [2019-09-08 12:15:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:38,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-08 12:15:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:38,062 INFO L225 Difference]: With dead ends: 4974 [2019-09-08 12:15:38,062 INFO L226 Difference]: Without dead ends: 3214 [2019-09-08 12:15:38,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2019-09-08 12:15:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3212. [2019-09-08 12:15:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2019-09-08 12:15:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5006 transitions. [2019-09-08 12:15:38,278 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5006 transitions. Word has length 199 [2019-09-08 12:15:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:38,278 INFO L475 AbstractCegarLoop]: Abstraction has 3212 states and 5006 transitions. [2019-09-08 12:15:38,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5006 transitions. [2019-09-08 12:15:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 12:15:38,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:38,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:38,292 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash 560825427, now seen corresponding path program 1 times [2019-09-08 12:15:38,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:38,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:38,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:38,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:38,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:38,443 INFO L87 Difference]: Start difference. First operand 3212 states and 5006 transitions. Second operand 3 states. [2019-09-08 12:15:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:38,717 INFO L93 Difference]: Finished difference Result 8760 states and 13677 transitions. [2019-09-08 12:15:38,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:38,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-08 12:15:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:38,746 INFO L225 Difference]: With dead ends: 8760 [2019-09-08 12:15:38,746 INFO L226 Difference]: Without dead ends: 5626 [2019-09-08 12:15:38,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2019-09-08 12:15:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 5624. [2019-09-08 12:15:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5624 states. [2019-09-08 12:15:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5624 states to 5624 states and 8710 transitions. [2019-09-08 12:15:39,065 INFO L78 Accepts]: Start accepts. Automaton has 5624 states and 8710 transitions. Word has length 202 [2019-09-08 12:15:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:39,066 INFO L475 AbstractCegarLoop]: Abstraction has 5624 states and 8710 transitions. [2019-09-08 12:15:39,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5624 states and 8710 transitions. [2019-09-08 12:15:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 12:15:39,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:39,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:39,081 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2136736005, now seen corresponding path program 1 times [2019-09-08 12:15:39,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:39,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:39,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:39,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:39,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:39,200 INFO L87 Difference]: Start difference. First operand 5624 states and 8710 transitions. Second operand 3 states. [2019-09-08 12:15:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:39,664 INFO L93 Difference]: Finished difference Result 15290 states and 23653 transitions. [2019-09-08 12:15:39,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:39,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 12:15:39,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:39,720 INFO L225 Difference]: With dead ends: 15290 [2019-09-08 12:15:39,720 INFO L226 Difference]: Without dead ends: 9750 [2019-09-08 12:15:39,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2019-09-08 12:15:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 9748. [2019-09-08 12:15:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9748 states. [2019-09-08 12:15:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9748 states to 9748 states and 14942 transitions. [2019-09-08 12:15:40,455 INFO L78 Accepts]: Start accepts. Automaton has 9748 states and 14942 transitions. Word has length 205 [2019-09-08 12:15:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:40,456 INFO L475 AbstractCegarLoop]: Abstraction has 9748 states and 14942 transitions. [2019-09-08 12:15:40,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 9748 states and 14942 transitions. [2019-09-08 12:15:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:15:40,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:40,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:40,497 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash -684524413, now seen corresponding path program 1 times [2019-09-08 12:15:40,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:40,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:40,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:40,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:40,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:40,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:40,905 INFO L87 Difference]: Start difference. First operand 9748 states and 14942 transitions. Second operand 3 states. [2019-09-08 12:15:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:42,158 INFO L93 Difference]: Finished difference Result 27946 states and 42847 transitions. [2019-09-08 12:15:42,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:42,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 12:15:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:42,216 INFO L225 Difference]: With dead ends: 27946 [2019-09-08 12:15:42,217 INFO L226 Difference]: Without dead ends: 19332 [2019-09-08 12:15:42,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19332 states. [2019-09-08 12:15:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19332 to 19330. [2019-09-08 12:15:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19330 states. [2019-09-08 12:15:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 29513 transitions. [2019-09-08 12:15:43,720 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 29513 transitions. Word has length 208 [2019-09-08 12:15:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:43,721 INFO L475 AbstractCegarLoop]: Abstraction has 19330 states and 29513 transitions. [2019-09-08 12:15:43,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 29513 transitions. [2019-09-08 12:15:43,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:15:43,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:43,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:43,767 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:43,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash 897876104, now seen corresponding path program 1 times [2019-09-08 12:15:43,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:43,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:43,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:43,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:43,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:43,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:43,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:43,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:43,872 INFO L87 Difference]: Start difference. First operand 19330 states and 29513 transitions. Second operand 3 states. [2019-09-08 12:15:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:45,384 INFO L93 Difference]: Finished difference Result 55066 states and 84045 transitions. [2019-09-08 12:15:45,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:45,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 12:15:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:45,471 INFO L225 Difference]: With dead ends: 55066 [2019-09-08 12:15:45,472 INFO L226 Difference]: Without dead ends: 38376 [2019-09-08 12:15:45,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:45,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38376 states. [2019-09-08 12:15:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38376 to 38374. [2019-09-08 12:15:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38374 states. [2019-09-08 12:15:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 58315 transitions. [2019-09-08 12:15:47,090 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 58315 transitions. Word has length 208 [2019-09-08 12:15:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:47,091 INFO L475 AbstractCegarLoop]: Abstraction has 38374 states and 58315 transitions. [2019-09-08 12:15:47,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 58315 transitions. [2019-09-08 12:15:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:15:47,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:47,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:47,191 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:47,192 INFO L82 PathProgramCache]: Analyzing trace with hash -312518254, now seen corresponding path program 1 times [2019-09-08 12:15:47,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:47,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:47,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:47,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:47,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:47,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:47,498 INFO L87 Difference]: Start difference. First operand 38374 states and 58315 transitions. Second operand 3 states. [2019-09-08 12:15:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:50,176 INFO L93 Difference]: Finished difference Result 111168 states and 168757 transitions. [2019-09-08 12:15:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:50,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 12:15:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:50,312 INFO L225 Difference]: With dead ends: 111168 [2019-09-08 12:15:50,313 INFO L226 Difference]: Without dead ends: 76298 [2019-09-08 12:15:50,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:50,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76298 states. [2019-09-08 12:15:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76298 to 76296. [2019-09-08 12:15:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76296 states. [2019-09-08 12:15:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76296 states to 76296 states and 115391 transitions. [2019-09-08 12:15:52,577 INFO L78 Accepts]: Start accepts. Automaton has 76296 states and 115391 transitions. Word has length 208 [2019-09-08 12:15:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:52,577 INFO L475 AbstractCegarLoop]: Abstraction has 76296 states and 115391 transitions. [2019-09-08 12:15:52,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 76296 states and 115391 transitions. [2019-09-08 12:15:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:15:52,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:52,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:52,737 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash 97169672, now seen corresponding path program 1 times [2019-09-08 12:15:52,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:52,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:52,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:52,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:52,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:52,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:52,902 INFO L87 Difference]: Start difference. First operand 76296 states and 115391 transitions. Second operand 3 states. [2019-09-08 12:15:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:56,971 INFO L93 Difference]: Finished difference Result 215748 states and 326033 transitions. [2019-09-08 12:15:56,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:56,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 12:15:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:57,174 INFO L225 Difference]: With dead ends: 215748 [2019-09-08 12:15:57,174 INFO L226 Difference]: Without dead ends: 151554 [2019-09-08 12:15:57,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151554 states. [2019-09-08 12:16:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151554 to 151552. [2019-09-08 12:16:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151552 states. [2019-09-08 12:16:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151552 states to 151552 states and 227919 transitions. [2019-09-08 12:16:03,005 INFO L78 Accepts]: Start accepts. Automaton has 151552 states and 227919 transitions. Word has length 208 [2019-09-08 12:16:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:03,006 INFO L475 AbstractCegarLoop]: Abstraction has 151552 states and 227919 transitions. [2019-09-08 12:16:03,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 151552 states and 227919 transitions. [2019-09-08 12:16:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:16:03,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:03,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:03,181 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 200913421, now seen corresponding path program 1 times [2019-09-08 12:16:03,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:03,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:03,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:03,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:03,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:03,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:03,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:03,387 INFO L87 Difference]: Start difference. First operand 151552 states and 227919 transitions. Second operand 5 states. [2019-09-08 12:16:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:13,069 INFO L93 Difference]: Finished difference Result 442566 states and 664081 transitions. [2019-09-08 12:16:13,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:13,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-09-08 12:16:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:13,437 INFO L225 Difference]: With dead ends: 442566 [2019-09-08 12:16:13,437 INFO L226 Difference]: Without dead ends: 291066 [2019-09-08 12:16:13,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291066 states. [2019-09-08 12:16:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291066 to 291064. [2019-09-08 12:16:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291064 states. [2019-09-08 12:16:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291064 states to 291064 states and 434662 transitions. [2019-09-08 12:16:25,915 INFO L78 Accepts]: Start accepts. Automaton has 291064 states and 434662 transitions. Word has length 208 [2019-09-08 12:16:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:25,915 INFO L475 AbstractCegarLoop]: Abstraction has 291064 states and 434662 transitions. [2019-09-08 12:16:25,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 291064 states and 434662 transitions. [2019-09-08 12:16:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:16:26,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:26,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:26,231 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1879775556, now seen corresponding path program 1 times [2019-09-08 12:16:26,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:26,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:26,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:26,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:26,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:26,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:26,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:26,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:26,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:26,390 INFO L87 Difference]: Start difference. First operand 291064 states and 434662 transitions. Second operand 5 states. [2019-09-08 12:16:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:34,794 INFO L93 Difference]: Finished difference Result 415034 states and 620199 transitions. [2019-09-08 12:16:34,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:34,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-09-08 12:16:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:34,955 INFO L225 Difference]: With dead ends: 415034 [2019-09-08 12:16:34,956 INFO L226 Difference]: Without dead ends: 146468 [2019-09-08 12:16:35,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146468 states. [2019-09-08 12:16:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146468 to 146468. [2019-09-08 12:16:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146468 states. [2019-09-08 12:16:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146468 states to 146468 states and 218274 transitions. [2019-09-08 12:16:40,262 INFO L78 Accepts]: Start accepts. Automaton has 146468 states and 218274 transitions. Word has length 208 [2019-09-08 12:16:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:40,262 INFO L475 AbstractCegarLoop]: Abstraction has 146468 states and 218274 transitions. [2019-09-08 12:16:40,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 146468 states and 218274 transitions. [2019-09-08 12:16:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:16:40,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:40,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:40,417 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1401934911, now seen corresponding path program 1 times [2019-09-08 12:16:40,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:40,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:40,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:40,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:40,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 12:16:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:40,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:40,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:40,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:40,611 INFO L87 Difference]: Start difference. First operand 146468 states and 218274 transitions. Second operand 5 states. [2019-09-08 12:16:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:47,471 INFO L93 Difference]: Finished difference Result 212418 states and 316647 transitions. [2019-09-08 12:16:47,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:47,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-09-08 12:16:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:47,555 INFO L225 Difference]: With dead ends: 212418 [2019-09-08 12:16:47,555 INFO L226 Difference]: Without dead ends: 73666 [2019-09-08 12:16:47,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:16:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73666 states. [2019-09-08 12:16:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73666 to 73666. [2019-09-08 12:16:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73666 states. [2019-09-08 12:16:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73666 states to 73666 states and 109570 transitions. [2019-09-08 12:16:49,752 INFO L78 Accepts]: Start accepts. Automaton has 73666 states and 109570 transitions. Word has length 208 [2019-09-08 12:16:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:49,752 INFO L475 AbstractCegarLoop]: Abstraction has 73666 states and 109570 transitions. [2019-09-08 12:16:49,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 73666 states and 109570 transitions. [2019-09-08 12:16:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:16:49,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:49,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:49,823 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash 653760604, now seen corresponding path program 1 times [2019-09-08 12:16:49,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:49,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:49,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:50,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:50,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:50,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:50,217 INFO L87 Difference]: Start difference. First operand 73666 states and 109570 transitions. Second operand 3 states. [2019-09-08 12:16:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:51,856 INFO L93 Difference]: Finished difference Result 115206 states and 171524 transitions. [2019-09-08 12:16:51,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:51,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 12:16:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:51,909 INFO L225 Difference]: With dead ends: 115206 [2019-09-08 12:16:51,909 INFO L226 Difference]: Without dead ends: 48416 [2019-09-08 12:16:51,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48416 states. [2019-09-08 12:16:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48416 to 48414. [2019-09-08 12:16:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48414 states. [2019-09-08 12:16:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48414 states to 48414 states and 71494 transitions. [2019-09-08 12:16:53,676 INFO L78 Accepts]: Start accepts. Automaton has 48414 states and 71494 transitions. Word has length 208 [2019-09-08 12:16:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:53,676 INFO L475 AbstractCegarLoop]: Abstraction has 48414 states and 71494 transitions. [2019-09-08 12:16:53,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 48414 states and 71494 transitions. [2019-09-08 12:16:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 12:16:53,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:53,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:53,709 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:53,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1860490876, now seen corresponding path program 1 times [2019-09-08 12:16:53,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:53,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:53,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:53,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:53,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:53,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:53,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:16:53,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:16:53,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:16:53,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:16:53,983 INFO L87 Difference]: Start difference. First operand 48414 states and 71494 transitions. Second operand 8 states. [2019-09-08 12:17:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:09,087 INFO L93 Difference]: Finished difference Result 480348 states and 707990 transitions. [2019-09-08 12:17:09,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:17:09,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 208 [2019-09-08 12:17:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:10,204 INFO L225 Difference]: With dead ends: 480348 [2019-09-08 12:17:10,204 INFO L226 Difference]: Without dead ends: 432096 [2019-09-08 12:17:10,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:17:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432096 states. [2019-09-08 12:17:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432096 to 142692. [2019-09-08 12:17:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142692 states. [2019-09-08 12:17:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142692 states to 142692 states and 208096 transitions. [2019-09-08 12:17:25,047 INFO L78 Accepts]: Start accepts. Automaton has 142692 states and 208096 transitions. Word has length 208 [2019-09-08 12:17:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:25,048 INFO L475 AbstractCegarLoop]: Abstraction has 142692 states and 208096 transitions. [2019-09-08 12:17:25,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:17:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 142692 states and 208096 transitions. [2019-09-08 12:17:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:17:25,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:25,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:25,162 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:25,163 INFO L82 PathProgramCache]: Analyzing trace with hash 269574654, now seen corresponding path program 1 times [2019-09-08 12:17:25,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:25,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:25,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:25,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:25,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:17:25,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:17:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:17:25,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:25,271 INFO L87 Difference]: Start difference. First operand 142692 states and 208096 transitions. Second operand 3 states. [2019-09-08 12:17:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:36,036 INFO L93 Difference]: Finished difference Result 317100 states and 461446 transitions. [2019-09-08 12:17:36,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:36,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 12:17:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:36,318 INFO L225 Difference]: With dead ends: 317100 [2019-09-08 12:17:36,318 INFO L226 Difference]: Without dead ends: 174562 [2019-09-08 12:17:36,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174562 states. [2019-09-08 12:17:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174562 to 174560. [2019-09-08 12:17:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174560 states. [2019-09-08 12:17:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174560 states to 174560 states and 251988 transitions. [2019-09-08 12:17:45,330 INFO L78 Accepts]: Start accepts. Automaton has 174560 states and 251988 transitions. Word has length 212 [2019-09-08 12:17:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:45,330 INFO L475 AbstractCegarLoop]: Abstraction has 174560 states and 251988 transitions. [2019-09-08 12:17:45,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:17:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 174560 states and 251988 transitions. [2019-09-08 12:17:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:17:45,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:45,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:45,475 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:45,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash -704600929, now seen corresponding path program 1 times [2019-09-08 12:17:45,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:45,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:45,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:45,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:45,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:45,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:45,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:17:45,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:17:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:17:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:45,617 INFO L87 Difference]: Start difference. First operand 174560 states and 251988 transitions. Second operand 3 states. [2019-09-08 12:17:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:51,662 INFO L93 Difference]: Finished difference Result 246292 states and 356838 transitions. [2019-09-08 12:17:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:51,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 12:17:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:51,772 INFO L225 Difference]: With dead ends: 246292 [2019-09-08 12:17:51,772 INFO L226 Difference]: Without dead ends: 88034 [2019-09-08 12:17:51,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88034 states. [2019-09-08 12:18:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88034 to 88032. [2019-09-08 12:18:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88032 states. [2019-09-08 12:18:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88032 states to 88032 states and 126132 transitions. [2019-09-08 12:18:00,811 INFO L78 Accepts]: Start accepts. Automaton has 88032 states and 126132 transitions. Word has length 212 [2019-09-08 12:18:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:00,811 INFO L475 AbstractCegarLoop]: Abstraction has 88032 states and 126132 transitions. [2019-09-08 12:18:00,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 88032 states and 126132 transitions. [2019-09-08 12:18:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:18:00,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:00,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:00,876 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash 444335492, now seen corresponding path program 1 times [2019-09-08 12:18:00,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:00,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:00,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:00,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:01,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:01,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:01,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:01,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:01,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:01,143 INFO L87 Difference]: Start difference. First operand 88032 states and 126132 transitions. Second operand 8 states. [2019-09-08 12:18:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:19,695 INFO L93 Difference]: Finished difference Result 424746 states and 608407 transitions. [2019-09-08 12:18:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:19,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-08 12:18:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:20,187 INFO L225 Difference]: With dead ends: 424746 [2019-09-08 12:18:20,187 INFO L226 Difference]: Without dead ends: 400052 [2019-09-08 12:18:20,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:18:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400052 states. [2019-09-08 12:18:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400052 to 144134. [2019-09-08 12:18:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144134 states. [2019-09-08 12:18:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144134 states to 144134 states and 205130 transitions. [2019-09-08 12:18:34,010 INFO L78 Accepts]: Start accepts. Automaton has 144134 states and 205130 transitions. Word has length 212 [2019-09-08 12:18:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:34,011 INFO L475 AbstractCegarLoop]: Abstraction has 144134 states and 205130 transitions. [2019-09-08 12:18:34,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 144134 states and 205130 transitions. [2019-09-08 12:18:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:18:34,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:34,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:34,131 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1139261002, now seen corresponding path program 1 times [2019-09-08 12:18:34,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:34,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:34,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:34,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:34,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:34,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:34,273 INFO L87 Difference]: Start difference. First operand 144134 states and 205130 transitions. Second operand 3 states. [2019-09-08 12:18:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:41,093 INFO L93 Difference]: Finished difference Result 206254 states and 294536 transitions. [2019-09-08 12:18:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:41,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 12:18:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:41,172 INFO L225 Difference]: With dead ends: 206254 [2019-09-08 12:18:41,172 INFO L226 Difference]: Without dead ends: 72502 [2019-09-08 12:18:41,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72502 states. [2019-09-08 12:18:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72502 to 72500. [2019-09-08 12:18:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72500 states. [2019-09-08 12:18:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72500 states to 72500 states and 102364 transitions. [2019-09-08 12:18:45,768 INFO L78 Accepts]: Start accepts. Automaton has 72500 states and 102364 transitions. Word has length 212 [2019-09-08 12:18:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:45,769 INFO L475 AbstractCegarLoop]: Abstraction has 72500 states and 102364 transitions. [2019-09-08 12:18:45,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 72500 states and 102364 transitions. [2019-09-08 12:18:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:18:45,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:45,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:45,829 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:45,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:45,829 INFO L82 PathProgramCache]: Analyzing trace with hash -307060370, now seen corresponding path program 1 times [2019-09-08 12:18:45,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:45,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:45,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:45,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:45,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:45,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:45,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:45,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:45,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:45,947 INFO L87 Difference]: Start difference. First operand 72500 states and 102364 transitions. Second operand 3 states. [2019-09-08 12:18:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:48,121 INFO L93 Difference]: Finished difference Result 93184 states and 132406 transitions. [2019-09-08 12:18:48,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:48,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 12:18:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:48,153 INFO L225 Difference]: With dead ends: 93184 [2019-09-08 12:18:48,153 INFO L226 Difference]: Without dead ends: 30536 [2019-09-08 12:18:48,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30536 states. [2019-09-08 12:18:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30536 to 30534. [2019-09-08 12:18:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30534 states. [2019-09-08 12:18:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30534 states to 30534 states and 43366 transitions. [2019-09-08 12:18:50,065 INFO L78 Accepts]: Start accepts. Automaton has 30534 states and 43366 transitions. Word has length 212 [2019-09-08 12:18:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:50,065 INFO L475 AbstractCegarLoop]: Abstraction has 30534 states and 43366 transitions. [2019-09-08 12:18:50,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30534 states and 43366 transitions. [2019-09-08 12:18:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:18:50,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:50,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:50,087 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash -652693046, now seen corresponding path program 1 times [2019-09-08 12:18:50,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:50,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:50,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:50,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:50,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:50,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:50,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:50,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:50,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:50,404 INFO L87 Difference]: Start difference. First operand 30534 states and 43366 transitions. Second operand 8 states. [2019-09-08 12:18:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:55,485 INFO L93 Difference]: Finished difference Result 84276 states and 120069 transitions. [2019-09-08 12:18:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:55,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-08 12:18:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:55,556 INFO L225 Difference]: With dead ends: 84276 [2019-09-08 12:18:55,556 INFO L226 Difference]: Without dead ends: 69514 [2019-09-08 12:18:55,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:18:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69514 states. [2019-09-08 12:18:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69514 to 42454. [2019-09-08 12:18:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42454 states. [2019-09-08 12:18:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42454 states to 42454 states and 60134 transitions. [2019-09-08 12:18:58,501 INFO L78 Accepts]: Start accepts. Automaton has 42454 states and 60134 transitions. Word has length 212 [2019-09-08 12:18:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:58,501 INFO L475 AbstractCegarLoop]: Abstraction has 42454 states and 60134 transitions. [2019-09-08 12:18:58,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 42454 states and 60134 transitions. [2019-09-08 12:18:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:18:58,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:58,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:58,533 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1848208190, now seen corresponding path program 1 times [2019-09-08 12:18:58,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:58,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:58,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:58,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:58,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:58,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:58,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:58,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:58,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:58,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:58,744 INFO L87 Difference]: Start difference. First operand 42454 states and 60134 transitions. Second operand 8 states. [2019-09-08 12:19:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:04,383 INFO L93 Difference]: Finished difference Result 96196 states and 136837 transitions. [2019-09-08 12:19:04,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:19:04,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-08 12:19:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:04,472 INFO L225 Difference]: With dead ends: 96196 [2019-09-08 12:19:04,472 INFO L226 Difference]: Without dead ends: 81434 [2019-09-08 12:19:04,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:19:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81434 states. [2019-09-08 12:19:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81434 to 54278. [2019-09-08 12:19:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54278 states. [2019-09-08 12:19:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54278 states to 54278 states and 76758 transitions. [2019-09-08 12:19:08,897 INFO L78 Accepts]: Start accepts. Automaton has 54278 states and 76758 transitions. Word has length 212 [2019-09-08 12:19:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:08,898 INFO L475 AbstractCegarLoop]: Abstraction has 54278 states and 76758 transitions. [2019-09-08 12:19:08,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 54278 states and 76758 transitions. [2019-09-08 12:19:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 12:19:08,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:08,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:08,935 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1701657416, now seen corresponding path program 1 times [2019-09-08 12:19:08,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:08,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:08,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:09,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:09,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:09,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:09,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:09,521 INFO L87 Difference]: Start difference. First operand 54278 states and 76758 transitions. Second operand 8 states. [2019-09-08 12:19:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:14,497 INFO L93 Difference]: Finished difference Result 113946 states and 161347 transitions. [2019-09-08 12:19:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:19:14,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-09-08 12:19:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:14,560 INFO L225 Difference]: With dead ends: 113946 [2019-09-08 12:19:14,560 INFO L226 Difference]: Without dead ends: 59826 [2019-09-08 12:19:14,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:19:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59826 states. [2019-09-08 12:19:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59826 to 54278. [2019-09-08 12:19:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54278 states. [2019-09-08 12:19:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54278 states to 54278 states and 76594 transitions. [2019-09-08 12:19:19,058 INFO L78 Accepts]: Start accepts. Automaton has 54278 states and 76594 transitions. Word has length 212 [2019-09-08 12:19:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:19,059 INFO L475 AbstractCegarLoop]: Abstraction has 54278 states and 76594 transitions. [2019-09-08 12:19:19,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 54278 states and 76594 transitions. [2019-09-08 12:19:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 12:19:19,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:19,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:19,096 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2121254364, now seen corresponding path program 1 times [2019-09-08 12:19:19,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:19,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:19,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:19,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:19,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:19,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:19,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:19,648 INFO L87 Difference]: Start difference. First operand 54278 states and 76594 transitions. Second operand 8 states. [2019-09-08 12:19:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:27,046 INFO L93 Difference]: Finished difference Result 104952 states and 149041 transitions. [2019-09-08 12:19:27,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:19:27,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-08 12:19:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:27,141 INFO L225 Difference]: With dead ends: 104952 [2019-09-08 12:19:27,142 INFO L226 Difference]: Without dead ends: 91754 [2019-09-08 12:19:27,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:19:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91754 states. [2019-09-08 12:19:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91754 to 64574. [2019-09-08 12:19:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64574 states. [2019-09-08 12:19:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64574 states to 64574 states and 91130 transitions. [2019-09-08 12:19:32,854 INFO L78 Accepts]: Start accepts. Automaton has 64574 states and 91130 transitions. Word has length 213 [2019-09-08 12:19:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:32,854 INFO L475 AbstractCegarLoop]: Abstraction has 64574 states and 91130 transitions. [2019-09-08 12:19:32,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 64574 states and 91130 transitions. [2019-09-08 12:19:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 12:19:32,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:32,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:32,899 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 202619752, now seen corresponding path program 1 times [2019-09-08 12:19:32,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:32,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:32,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:33,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:33,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:33,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:33,176 INFO L87 Difference]: Start difference. First operand 64574 states and 91130 transitions. Second operand 8 states. [2019-09-08 12:19:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:42,485 INFO L93 Difference]: Finished difference Result 118316 states and 167833 transitions. [2019-09-08 12:19:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:19:42,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-08 12:19:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:42,585 INFO L225 Difference]: With dead ends: 118316 [2019-09-08 12:19:42,585 INFO L226 Difference]: Without dead ends: 103554 [2019-09-08 12:19:42,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:19:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103554 states. [2019-09-08 12:19:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103554 to 76494. [2019-09-08 12:19:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76494 states. [2019-09-08 12:19:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76494 states to 76494 states and 107898 transitions. [2019-09-08 12:19:49,434 INFO L78 Accepts]: Start accepts. Automaton has 76494 states and 107898 transitions. Word has length 213 [2019-09-08 12:19:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:49,434 INFO L475 AbstractCegarLoop]: Abstraction has 76494 states and 107898 transitions. [2019-09-08 12:19:49,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 76494 states and 107898 transitions. [2019-09-08 12:19:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 12:19:49,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:49,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:49,490 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 940546938, now seen corresponding path program 1 times [2019-09-08 12:19:49,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:49,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:49,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:49,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:50,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:50,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:50,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:50,103 INFO L87 Difference]: Start difference. First operand 76494 states and 107898 transitions. Second operand 8 states. [2019-09-08 12:20:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:00,694 INFO L93 Difference]: Finished difference Result 128502 states and 182723 transitions. [2019-09-08 12:20:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:00,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-08 12:20:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:00,816 INFO L225 Difference]: With dead ends: 128502 [2019-09-08 12:20:00,816 INFO L226 Difference]: Without dead ends: 123608 [2019-09-08 12:20:00,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:20:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123608 states. [2019-09-08 12:20:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123608 to 81690. [2019-09-08 12:20:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81690 states. [2019-09-08 12:20:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81690 states to 81690 states and 115322 transitions. [2019-09-08 12:20:09,892 INFO L78 Accepts]: Start accepts. Automaton has 81690 states and 115322 transitions. Word has length 213 [2019-09-08 12:20:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:10,115 INFO L475 AbstractCegarLoop]: Abstraction has 81690 states and 115322 transitions. [2019-09-08 12:20:10,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 81690 states and 115322 transitions. [2019-09-08 12:20:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 12:20:10,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:10,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:10,170 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1430789519, now seen corresponding path program 1 times [2019-09-08 12:20:10,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:10,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:10,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:10,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:10,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:10,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:10,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:20:10,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:20:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:20:10,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:20:10,548 INFO L87 Difference]: Start difference. First operand 81690 states and 115322 transitions. Second operand 10 states. [2019-09-08 12:21:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:10,263 INFO L93 Difference]: Finished difference Result 673306 states and 950933 transitions. [2019-09-08 12:21:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:21:10,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2019-09-08 12:21:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:10,998 INFO L225 Difference]: With dead ends: 673306 [2019-09-08 12:21:10,999 INFO L226 Difference]: Without dead ends: 591746 [2019-09-08 12:21:11,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:21:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591746 states. [2019-09-08 12:21:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591746 to 149324. [2019-09-08 12:21:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149324 states. [2019-09-08 12:21:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149324 states to 149324 states and 210048 transitions. [2019-09-08 12:21:32,748 INFO L78 Accepts]: Start accepts. Automaton has 149324 states and 210048 transitions. Word has length 215 [2019-09-08 12:21:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:32,748 INFO L475 AbstractCegarLoop]: Abstraction has 149324 states and 210048 transitions. [2019-09-08 12:21:32,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:21:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 149324 states and 210048 transitions. [2019-09-08 12:21:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 12:21:32,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:32,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:32,871 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1674445669, now seen corresponding path program 1 times [2019-09-08 12:21:32,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:32,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:32,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:33,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:33,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:21:33,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:21:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:21:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:21:33,164 INFO L87 Difference]: Start difference. First operand 149324 states and 210048 transitions. Second operand 10 states. [2019-09-08 12:23:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:14,050 INFO L93 Difference]: Finished difference Result 975695 states and 1372979 transitions. [2019-09-08 12:23:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:23:14,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2019-09-08 12:23:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:15,178 INFO L225 Difference]: With dead ends: 975695 [2019-09-08 12:23:15,178 INFO L226 Difference]: Without dead ends: 827097 [2019-09-08 12:23:15,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:23:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827097 states. [2019-09-08 12:23:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827097 to 143955. [2019-09-08 12:23:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143955 states. [2019-09-08 12:23:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143955 states to 143955 states and 202310 transitions. [2019-09-08 12:23:40,264 INFO L78 Accepts]: Start accepts. Automaton has 143955 states and 202310 transitions. Word has length 215 [2019-09-08 12:23:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:40,264 INFO L475 AbstractCegarLoop]: Abstraction has 143955 states and 202310 transitions. [2019-09-08 12:23:40,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:23:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 143955 states and 202310 transitions. [2019-09-08 12:23:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 12:23:40,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:40,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:40,369 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1606591339, now seen corresponding path program 1 times [2019-09-08 12:23:40,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:40,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:40,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:40,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:23:40,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:23:40,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:23:40,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:23:40,772 INFO L87 Difference]: Start difference. First operand 143955 states and 202310 transitions. Second operand 14 states. [2019-09-08 12:24:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:59,491 INFO L93 Difference]: Finished difference Result 656174 states and 918865 transitions. [2019-09-08 12:24:59,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:24:59,492 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 215 [2019-09-08 12:24:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:00,183 INFO L225 Difference]: With dead ends: 656174 [2019-09-08 12:25:00,183 INFO L226 Difference]: Without dead ends: 550632 [2019-09-08 12:25:00,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:25:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550632 states. [2019-09-08 12:25:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550632 to 144269. [2019-09-08 12:25:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144269 states. [2019-09-08 12:25:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144269 states to 144269 states and 202690 transitions. [2019-09-08 12:25:30,225 INFO L78 Accepts]: Start accepts. Automaton has 144269 states and 202690 transitions. Word has length 215 [2019-09-08 12:25:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:30,225 INFO L475 AbstractCegarLoop]: Abstraction has 144269 states and 202690 transitions. [2019-09-08 12:25:30,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:25:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 144269 states and 202690 transitions. [2019-09-08 12:25:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 12:25:30,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:30,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:30,317 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:30,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:30,318 INFO L82 PathProgramCache]: Analyzing trace with hash 328296319, now seen corresponding path program 1 times [2019-09-08 12:25:30,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:30,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:30,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:30,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:30,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:30,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:30,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:30,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:30,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:30,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:30,437 INFO L87 Difference]: Start difference. First operand 144269 states and 202690 transitions. Second operand 3 states. [2019-09-08 12:25:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:41,549 INFO L93 Difference]: Finished difference Result 204477 states and 288068 transitions. [2019-09-08 12:25:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:41,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-08 12:25:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:41,637 INFO L225 Difference]: With dead ends: 204477 [2019-09-08 12:25:41,638 INFO L226 Difference]: Without dead ends: 74380 [2019-09-08 12:25:41,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74380 states. [2019-09-08 12:25:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74380 to 74378. [2019-09-08 12:25:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74378 states. [2019-09-08 12:25:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74378 states to 74378 states and 103869 transitions. [2019-09-08 12:25:52,142 INFO L78 Accepts]: Start accepts. Automaton has 74378 states and 103869 transitions. Word has length 215 [2019-09-08 12:25:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:52,142 INFO L475 AbstractCegarLoop]: Abstraction has 74378 states and 103869 transitions. [2019-09-08 12:25:52,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 74378 states and 103869 transitions. [2019-09-08 12:25:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 12:25:52,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:52,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:52,199 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1132820967, now seen corresponding path program 1 times [2019-09-08 12:25:52,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:52,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:52,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:52,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:52,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:52,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:52,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:52,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:52,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:52,276 INFO L87 Difference]: Start difference. First operand 74378 states and 103869 transitions. Second operand 3 states. [2019-09-08 12:26:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:04,230 INFO L93 Difference]: Finished difference Result 147443 states and 206331 transitions. [2019-09-08 12:26:04,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:26:04,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 12:26:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:04,312 INFO L225 Difference]: With dead ends: 147443 [2019-09-08 12:26:04,312 INFO L226 Difference]: Without dead ends: 73448 [2019-09-08 12:26:04,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:26:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73448 states. [2019-09-08 12:26:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73448 to 73448. [2019-09-08 12:26:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73448 states. [2019-09-08 12:26:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73448 states to 73448 states and 102179 transitions. [2019-09-08 12:26:14,215 INFO L78 Accepts]: Start accepts. Automaton has 73448 states and 102179 transitions. Word has length 216 [2019-09-08 12:26:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:14,215 INFO L475 AbstractCegarLoop]: Abstraction has 73448 states and 102179 transitions. [2019-09-08 12:26:14,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:26:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 73448 states and 102179 transitions. [2019-09-08 12:26:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 12:26:14,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:14,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:14,267 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1194416177, now seen corresponding path program 1 times [2019-09-08 12:26:14,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:14,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:14,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:14,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:26:14,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:26:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:26:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:26:14,749 INFO L87 Difference]: Start difference. First operand 73448 states and 102179 transitions. Second operand 12 states. [2019-09-08 12:27:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:01,358 INFO L93 Difference]: Finished difference Result 331855 states and 463514 transitions. [2019-09-08 12:27:01,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:27:01,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-09-08 12:27:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:01,659 INFO L225 Difference]: With dead ends: 331855 [2019-09-08 12:27:01,659 INFO L226 Difference]: Without dead ends: 279877 [2019-09-08 12:27:01,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=763, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:27:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279877 states. [2019-09-08 12:27:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279877 to 82918. [2019-09-08 12:27:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82918 states. [2019-09-08 12:27:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82918 states to 82918 states and 114195 transitions. [2019-09-08 12:27:21,806 INFO L78 Accepts]: Start accepts. Automaton has 82918 states and 114195 transitions. Word has length 216 [2019-09-08 12:27:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:21,807 INFO L475 AbstractCegarLoop]: Abstraction has 82918 states and 114195 transitions. [2019-09-08 12:27:21,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:27:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 82918 states and 114195 transitions. [2019-09-08 12:27:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 12:27:21,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:21,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:21,866 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:21,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1630308617, now seen corresponding path program 1 times [2019-09-08 12:27:21,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:21,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:21,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:22,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:27:22,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:27:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:27:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:27:22,364 INFO L87 Difference]: Start difference. First operand 82918 states and 114195 transitions. Second operand 12 states.