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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:00:40,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:00:40,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:00:40,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:00:40,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:00:40,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:00:40,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:00:40,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:00:40,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:00:40,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:00:40,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:00:40,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:00:40,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:00:40,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:00:40,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:00:40,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:00:40,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:00:40,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:00:40,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:00:40,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:00:40,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:00:40,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:00:40,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:00:40,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:00:40,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:00:40,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:00:40,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:00:40,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:00:40,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:00:40,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:00:40,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:00:40,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:00:40,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:00:40,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:00:40,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:00:40,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:00:40,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:00:40,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:00:40,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:00:40,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:00:40,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:00:40,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 09:00:40,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:00:40,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:00:40,314 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:00:40,315 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:00:40,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:00:40,316 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:00:40,316 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:00:40,316 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:00:40,316 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:00:40,316 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:00:40,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:00:40,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:00:40,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:00:40,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:00:40,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:00:40,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:00:40,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:00:40,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:00:40,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:00:40,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:00:40,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:00:40,320 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:00:40,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:00:40,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:00:40,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:00:40,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:00:40,321 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:00:40,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:00:40,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:00:40,321 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:00:40,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:00:40,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:00:40,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:00:40,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:00:40,374 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:00:40,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 09:00:40,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc25d99f6/412717d1296e4459a907ed17abb08521/FLAGbe5adfc5f [2019-09-10 09:00:41,010 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:00:41,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 09:00:41,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc25d99f6/412717d1296e4459a907ed17abb08521/FLAGbe5adfc5f [2019-09-10 09:00:41,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc25d99f6/412717d1296e4459a907ed17abb08521 [2019-09-10 09:00:41,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:00:41,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:00:41,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:41,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:00:41,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:00:41,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:41" (1/1) ... [2019-09-10 09:00:41,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6589a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:41, skipping insertion in model container [2019-09-10 09:00:41,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:41" (1/1) ... [2019-09-10 09:00:41,281 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:00:41,356 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:00:41,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:41,903 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:00:42,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:42,194 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:00:42,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42 WrapperNode [2019-09-10 09:00:42,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:42,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:00:42,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:00:42,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:00:42,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (1/1) ... [2019-09-10 09:00:42,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (1/1) ... [2019-09-10 09:00:42,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (1/1) ... [2019-09-10 09:00:42,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (1/1) ... [2019-09-10 09:00:42,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (1/1) ... [2019-09-10 09:00:42,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (1/1) ... [2019-09-10 09:00:42,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (1/1) ... [2019-09-10 09:00:42,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:00:42,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:00:42,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:00:42,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:00:42,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (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-10 09:00:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:00:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:00:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:00:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:00:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:00:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 09:00:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:00:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:00:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:00:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:00:42,412 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:00:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:00:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:00:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:00:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:00:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:00:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:00:42,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:00:42,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:00:42,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:00:43,902 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:00:43,902 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:00:43,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:43 BoogieIcfgContainer [2019-09-10 09:00:43,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:00:43,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:00:43,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:00:43,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:00:43,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:00:41" (1/3) ... [2019-09-10 09:00:43,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5925d620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:43, skipping insertion in model container [2019-09-10 09:00:43,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:42" (2/3) ... [2019-09-10 09:00:43,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5925d620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:43, skipping insertion in model container [2019-09-10 09:00:43,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:43" (3/3) ... [2019-09-10 09:00:43,913 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 09:00:43,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:00:43,938 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:00:43,955 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:00:43,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:00:43,984 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:00:43,984 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:00:43,985 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:00:43,985 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:00:43,985 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:00:43,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:00:43,985 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:00:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states. [2019-09-10 09:00:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 09:00:44,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:44,035 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] [2019-09-10 09:00:44,037 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:44,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1819873083, now seen corresponding path program 1 times [2019-09-10 09:00:44,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:44,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:44,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:44,711 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-10 09:00:44,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:44,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:44,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:44,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:44,740 INFO L87 Difference]: Start difference. First operand 356 states. Second operand 3 states. [2019-09-10 09:00:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:44,892 INFO L93 Difference]: Finished difference Result 503 states and 864 transitions. [2019-09-10 09:00:44,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:44,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 09:00:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:44,921 INFO L225 Difference]: With dead ends: 503 [2019-09-10 09:00:44,921 INFO L226 Difference]: Without dead ends: 495 [2019-09-10 09:00:44,923 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-10 09:00:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-10 09:00:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2019-09-10 09:00:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-09-10 09:00:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 809 transitions. [2019-09-10 09:00:45,004 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 809 transitions. Word has length 122 [2019-09-10 09:00:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:45,005 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 809 transitions. [2019-09-10 09:00:45,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 809 transitions. [2019-09-10 09:00:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 09:00:45,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:45,016 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] [2019-09-10 09:00:45,016 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1319699854, now seen corresponding path program 1 times [2019-09-10 09:00:45,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:45,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:45,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:45,288 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-10 09:00:45,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:45,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:45,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:45,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:45,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:45,292 INFO L87 Difference]: Start difference. First operand 492 states and 809 transitions. Second operand 3 states. [2019-09-10 09:00:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:45,342 INFO L93 Difference]: Finished difference Result 767 states and 1261 transitions. [2019-09-10 09:00:45,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:45,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 09:00:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:45,348 INFO L225 Difference]: With dead ends: 767 [2019-09-10 09:00:45,348 INFO L226 Difference]: Without dead ends: 767 [2019-09-10 09:00:45,349 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-10 09:00:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-09-10 09:00:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 763. [2019-09-10 09:00:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-09-10 09:00:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1258 transitions. [2019-09-10 09:00:45,384 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1258 transitions. Word has length 125 [2019-09-10 09:00:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:45,385 INFO L475 AbstractCegarLoop]: Abstraction has 763 states and 1258 transitions. [2019-09-10 09:00:45,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1258 transitions. [2019-09-10 09:00:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 09:00:45,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:45,390 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] [2019-09-10 09:00:45,390 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238682, now seen corresponding path program 1 times [2019-09-10 09:00:45,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:45,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:45,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:45,539 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-10 09:00:45,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:45,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:45,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:45,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:45,542 INFO L87 Difference]: Start difference. First operand 763 states and 1258 transitions. Second operand 3 states. [2019-09-10 09:00:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:45,589 INFO L93 Difference]: Finished difference Result 1289 states and 2119 transitions. [2019-09-10 09:00:45,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:45,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 09:00:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:45,598 INFO L225 Difference]: With dead ends: 1289 [2019-09-10 09:00:45,598 INFO L226 Difference]: Without dead ends: 1289 [2019-09-10 09:00:45,598 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-10 09:00:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-09-10 09:00:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1283. [2019-09-10 09:00:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-09-10 09:00:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2114 transitions. [2019-09-10 09:00:45,632 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2114 transitions. Word has length 128 [2019-09-10 09:00:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:45,633 INFO L475 AbstractCegarLoop]: Abstraction has 1283 states and 2114 transitions. [2019-09-10 09:00:45,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2114 transitions. [2019-09-10 09:00:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 09:00:45,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:45,636 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] [2019-09-10 09:00:45,637 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:45,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash 820062537, now seen corresponding path program 1 times [2019-09-10 09:00:45,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:45,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:45,823 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-10 09:00:45,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:45,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:45,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:45,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:45,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:45,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:45,826 INFO L87 Difference]: Start difference. First operand 1283 states and 2114 transitions. Second operand 3 states. [2019-09-10 09:00:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:45,885 INFO L93 Difference]: Finished difference Result 2289 states and 3743 transitions. [2019-09-10 09:00:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:45,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 09:00:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:45,899 INFO L225 Difference]: With dead ends: 2289 [2019-09-10 09:00:45,900 INFO L226 Difference]: Without dead ends: 2289 [2019-09-10 09:00:45,900 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-10 09:00:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-09-10 09:00:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2279. [2019-09-10 09:00:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-09-10 09:00:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3734 transitions. [2019-09-10 09:00:45,964 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3734 transitions. Word has length 131 [2019-09-10 09:00:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:45,965 INFO L475 AbstractCegarLoop]: Abstraction has 2279 states and 3734 transitions. [2019-09-10 09:00:45,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3734 transitions. [2019-09-10 09:00:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 09:00:45,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:45,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:45,968 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1594765883, now seen corresponding path program 1 times [2019-09-10 09:00:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:45,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:45,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:46,218 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-10 09:00:46,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:46,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:00:46,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:46,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:00:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:00:46,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:00:46,221 INFO L87 Difference]: Start difference. First operand 2279 states and 3734 transitions. Second operand 6 states. [2019-09-10 09:00:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:46,591 INFO L93 Difference]: Finished difference Result 6615 states and 10898 transitions. [2019-09-10 09:00:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:00:46,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 09:00:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:46,627 INFO L225 Difference]: With dead ends: 6615 [2019-09-10 09:00:46,627 INFO L226 Difference]: Without dead ends: 6615 [2019-09-10 09:00:46,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:00:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6615 states. [2019-09-10 09:00:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6615 to 5202. [2019-09-10 09:00:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2019-09-10 09:00:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 8546 transitions. [2019-09-10 09:00:46,777 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 8546 transitions. Word has length 134 [2019-09-10 09:00:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:46,777 INFO L475 AbstractCegarLoop]: Abstraction has 5202 states and 8546 transitions. [2019-09-10 09:00:46,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:00:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 8546 transitions. [2019-09-10 09:00:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 09:00:46,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:46,781 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] [2019-09-10 09:00:46,781 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2126933855, now seen corresponding path program 1 times [2019-09-10 09:00:46,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:46,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:46,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:46,967 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-10 09:00:46,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:46,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:46,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:46,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:46,970 INFO L87 Difference]: Start difference. First operand 5202 states and 8546 transitions. Second operand 4 states. [2019-09-10 09:00:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:47,135 INFO L93 Difference]: Finished difference Result 8799 states and 14510 transitions. [2019-09-10 09:00:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:47,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 09:00:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:47,186 INFO L225 Difference]: With dead ends: 8799 [2019-09-10 09:00:47,186 INFO L226 Difference]: Without dead ends: 8799 [2019-09-10 09:00:47,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-09-10 09:00:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 7685. [2019-09-10 09:00:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7685 states. [2019-09-10 09:00:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 12648 transitions. [2019-09-10 09:00:47,463 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 12648 transitions. Word has length 135 [2019-09-10 09:00:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:47,464 INFO L475 AbstractCegarLoop]: Abstraction has 7685 states and 12648 transitions. [2019-09-10 09:00:47,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 12648 transitions. [2019-09-10 09:00:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 09:00:47,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:47,470 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] [2019-09-10 09:00:47,471 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1448829826, now seen corresponding path program 1 times [2019-09-10 09:00:47,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:47,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:47,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:47,668 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-10 09:00:47,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:47,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:47,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:47,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:47,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:47,671 INFO L87 Difference]: Start difference. First operand 7685 states and 12648 transitions. Second operand 4 states. [2019-09-10 09:00:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:47,855 INFO L93 Difference]: Finished difference Result 12964 states and 21343 transitions. [2019-09-10 09:00:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:47,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 09:00:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:47,902 INFO L225 Difference]: With dead ends: 12964 [2019-09-10 09:00:47,902 INFO L226 Difference]: Without dead ends: 12964 [2019-09-10 09:00:47,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12964 states. [2019-09-10 09:00:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12964 to 11286. [2019-09-10 09:00:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11286 states. [2019-09-10 09:00:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11286 states to 11286 states and 18559 transitions. [2019-09-10 09:00:48,262 INFO L78 Accepts]: Start accepts. Automaton has 11286 states and 18559 transitions. Word has length 136 [2019-09-10 09:00:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:48,262 INFO L475 AbstractCegarLoop]: Abstraction has 11286 states and 18559 transitions. [2019-09-10 09:00:48,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 11286 states and 18559 transitions. [2019-09-10 09:00:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 09:00:48,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:48,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:00:48,268 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1906999430, now seen corresponding path program 1 times [2019-09-10 09:00:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:48,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:48,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:48,446 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-10 09:00:48,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:48,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:00:48,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:48,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:00:48,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:00:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:00:48,449 INFO L87 Difference]: Start difference. First operand 11286 states and 18559 transitions. Second operand 7 states. [2019-09-10 09:00:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:49,207 INFO L93 Difference]: Finished difference Result 41651 states and 68358 transitions. [2019-09-10 09:00:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 09:00:49,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 09:00:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:49,310 INFO L225 Difference]: With dead ends: 41651 [2019-09-10 09:00:49,311 INFO L226 Difference]: Without dead ends: 41651 [2019-09-10 09:00:49,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 09:00:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41651 states. [2019-09-10 09:00:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41651 to 32467. [2019-09-10 09:00:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32467 states. [2019-09-10 09:00:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32467 states to 32467 states and 53209 transitions. [2019-09-10 09:00:50,602 INFO L78 Accepts]: Start accepts. Automaton has 32467 states and 53209 transitions. Word has length 137 [2019-09-10 09:00:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:50,603 INFO L475 AbstractCegarLoop]: Abstraction has 32467 states and 53209 transitions. [2019-09-10 09:00:50,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:00:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 32467 states and 53209 transitions. [2019-09-10 09:00:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 09:00:50,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:50,609 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] [2019-09-10 09:00:50,609 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1629889350, now seen corresponding path program 1 times [2019-09-10 09:00:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:50,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:50,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:50,708 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-10 09:00:50,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:50,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:50,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:50,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:50,710 INFO L87 Difference]: Start difference. First operand 32467 states and 53209 transitions. Second operand 3 states. [2019-09-10 09:00:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:50,902 INFO L93 Difference]: Finished difference Result 48696 states and 79749 transitions. [2019-09-10 09:00:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:50,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 09:00:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:51,010 INFO L225 Difference]: With dead ends: 48696 [2019-09-10 09:00:51,010 INFO L226 Difference]: Without dead ends: 48696 [2019-09-10 09:00:51,011 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-10 09:00:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48696 states. [2019-09-10 09:00:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48696 to 48694. [2019-09-10 09:00:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48694 states. [2019-09-10 09:00:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48694 states to 48694 states and 79748 transitions. [2019-09-10 09:00:51,860 INFO L78 Accepts]: Start accepts. Automaton has 48694 states and 79748 transitions. Word has length 138 [2019-09-10 09:00:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:51,860 INFO L475 AbstractCegarLoop]: Abstraction has 48694 states and 79748 transitions. [2019-09-10 09:00:51,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 48694 states and 79748 transitions. [2019-09-10 09:00:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 09:00:51,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:51,864 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] [2019-09-10 09:00:51,864 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1317118186, now seen corresponding path program 1 times [2019-09-10 09:00:51,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:51,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:51,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:51,954 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-10 09:00:51,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:51,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:51,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:51,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:51,956 INFO L87 Difference]: Start difference. First operand 48694 states and 79748 transitions. Second operand 3 states. [2019-09-10 09:00:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:52,239 INFO L93 Difference]: Finished difference Result 72964 states and 119156 transitions. [2019-09-10 09:00:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:52,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 09:00:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:52,389 INFO L225 Difference]: With dead ends: 72964 [2019-09-10 09:00:52,389 INFO L226 Difference]: Without dead ends: 72964 [2019-09-10 09:00:52,390 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-10 09:00:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72964 states. [2019-09-10 09:00:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72964 to 72962. [2019-09-10 09:00:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72962 states. [2019-09-10 09:00:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72962 states to 72962 states and 119155 transitions. [2019-09-10 09:00:54,867 INFO L78 Accepts]: Start accepts. Automaton has 72962 states and 119155 transitions. Word has length 138 [2019-09-10 09:00:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:54,867 INFO L475 AbstractCegarLoop]: Abstraction has 72962 states and 119155 transitions. [2019-09-10 09:00:54,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 72962 states and 119155 transitions. [2019-09-10 09:00:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 09:00:54,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:54,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] [2019-09-10 09:00:54,870 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1065054007, now seen corresponding path program 1 times [2019-09-10 09:00:54,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:54,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:54,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:54,975 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-10 09:00:54,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:54,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:54,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:54,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:54,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:54,977 INFO L87 Difference]: Start difference. First operand 72962 states and 119155 transitions. Second operand 4 states. [2019-09-10 09:00:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:55,516 INFO L93 Difference]: Finished difference Result 126794 states and 207495 transitions. [2019-09-10 09:00:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:55,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 09:00:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:55,745 INFO L225 Difference]: With dead ends: 126794 [2019-09-10 09:00:55,745 INFO L226 Difference]: Without dead ends: 126794 [2019-09-10 09:00:55,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 09:00:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126794 states. [2019-09-10 09:00:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126794 to 99644. [2019-09-10 09:00:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99644 states. [2019-09-10 09:00:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99644 states to 99644 states and 162703 transitions. [2019-09-10 09:00:59,011 INFO L78 Accepts]: Start accepts. Automaton has 99644 states and 162703 transitions. Word has length 138 [2019-09-10 09:00:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:59,012 INFO L475 AbstractCegarLoop]: Abstraction has 99644 states and 162703 transitions. [2019-09-10 09:00:59,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 99644 states and 162703 transitions. [2019-09-10 09:00:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 09:00:59,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:59,014 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] [2019-09-10 09:00:59,014 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 192784978, now seen corresponding path program 1 times [2019-09-10 09:00:59,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:59,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:59,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:59,113 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-10 09:00:59,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:59,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:59,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:59,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:59,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:59,115 INFO L87 Difference]: Start difference. First operand 99644 states and 162703 transitions. Second operand 3 states. [2019-09-10 09:00:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:59,572 INFO L93 Difference]: Finished difference Result 149226 states and 242457 transitions. [2019-09-10 09:00:59,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:59,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-10 09:00:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:59,794 INFO L225 Difference]: With dead ends: 149226 [2019-09-10 09:00:59,794 INFO L226 Difference]: Without dead ends: 149226 [2019-09-10 09:00:59,794 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-10 09:00:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149226 states. [2019-09-10 09:01:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149226 to 149224. [2019-09-10 09:01:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149224 states. [2019-09-10 09:01:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149224 states to 149224 states and 242456 transitions. [2019-09-10 09:01:03,778 INFO L78 Accepts]: Start accepts. Automaton has 149224 states and 242456 transitions. Word has length 138 [2019-09-10 09:01:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:03,778 INFO L475 AbstractCegarLoop]: Abstraction has 149224 states and 242456 transitions. [2019-09-10 09:01:03,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 149224 states and 242456 transitions. [2019-09-10 09:01:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 09:01:03,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:03,780 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] [2019-09-10 09:01:03,780 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1141935655, now seen corresponding path program 1 times [2019-09-10 09:01:03,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:03,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:03,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:03,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:03,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:03,885 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-10 09:01:03,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:03,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:03,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:03,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:03,887 INFO L87 Difference]: Start difference. First operand 149224 states and 242456 transitions. Second operand 3 states. [2019-09-10 09:01:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:05,069 INFO L93 Difference]: Finished difference Result 218383 states and 352761 transitions. [2019-09-10 09:01:05,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:05,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 09:01:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:05,391 INFO L225 Difference]: With dead ends: 218383 [2019-09-10 09:01:05,392 INFO L226 Difference]: Without dead ends: 218383 [2019-09-10 09:01:05,392 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-10 09:01:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218383 states. [2019-09-10 09:01:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218383 to 218381. [2019-09-10 09:01:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218381 states. [2019-09-10 09:01:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218381 states to 218381 states and 352760 transitions. [2019-09-10 09:01:10,536 INFO L78 Accepts]: Start accepts. Automaton has 218381 states and 352760 transitions. Word has length 139 [2019-09-10 09:01:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:10,537 INFO L475 AbstractCegarLoop]: Abstraction has 218381 states and 352760 transitions. [2019-09-10 09:01:10,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 218381 states and 352760 transitions. [2019-09-10 09:01:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 09:01:10,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:10,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:10,538 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:10,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1490654585, now seen corresponding path program 1 times [2019-09-10 09:01:10,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:10,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:10,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:01:10,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:10,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:01:10,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:10,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:01:10,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:01:10,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:01:10,863 INFO L87 Difference]: Start difference. First operand 218381 states and 352760 transitions. Second operand 6 states. [2019-09-10 09:01:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:14,687 INFO L93 Difference]: Finished difference Result 315256 states and 509482 transitions. [2019-09-10 09:01:14,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:01:14,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 09:01:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:15,117 INFO L225 Difference]: With dead ends: 315256 [2019-09-10 09:01:15,117 INFO L226 Difference]: Without dead ends: 315256 [2019-09-10 09:01:15,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:01:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315256 states. [2019-09-10 09:01:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315256 to 249116. [2019-09-10 09:01:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249116 states. [2019-09-10 09:01:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249116 states to 249116 states and 401720 transitions. [2019-09-10 09:01:18,367 INFO L78 Accepts]: Start accepts. Automaton has 249116 states and 401720 transitions. Word has length 140 [2019-09-10 09:01:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:18,367 INFO L475 AbstractCegarLoop]: Abstraction has 249116 states and 401720 transitions. [2019-09-10 09:01:18,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:01:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 249116 states and 401720 transitions. [2019-09-10 09:01:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 09:01:18,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:18,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:18,368 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash 374584311, now seen corresponding path program 1 times [2019-09-10 09:01:18,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:18,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:18,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:18,624 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-10 09:01:18,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:01:18,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:18,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:01:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:01:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:01:18,626 INFO L87 Difference]: Start difference. First operand 249116 states and 401720 transitions. Second operand 6 states. [2019-09-10 09:01:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:23,184 INFO L93 Difference]: Finished difference Result 483971 states and 781212 transitions. [2019-09-10 09:01:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:01:23,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 09:01:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:23,850 INFO L225 Difference]: With dead ends: 483971 [2019-09-10 09:01:23,850 INFO L226 Difference]: Without dead ends: 483971 [2019-09-10 09:01:23,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:01:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483971 states. [2019-09-10 09:01:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483971 to 443345. [2019-09-10 09:01:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443345 states. [2019-09-10 09:01:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443345 states to 443345 states and 714601 transitions. [2019-09-10 09:01:29,952 INFO L78 Accepts]: Start accepts. Automaton has 443345 states and 714601 transitions. Word has length 143 [2019-09-10 09:01:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:29,952 INFO L475 AbstractCegarLoop]: Abstraction has 443345 states and 714601 transitions. [2019-09-10 09:01:29,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:01:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 443345 states and 714601 transitions. [2019-09-10 09:01:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 09:01:29,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:29,954 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] [2019-09-10 09:01:29,954 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1274697322, now seen corresponding path program 1 times [2019-09-10 09:01:29,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:29,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:29,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:29,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:30,118 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-10 09:01:30,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:30,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:01:30,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:30,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:01:30,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:01:30,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:01:30,121 INFO L87 Difference]: Start difference. First operand 443345 states and 714601 transitions. Second operand 5 states. [2019-09-10 09:01:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:37,893 INFO L93 Difference]: Finished difference Result 742227 states and 1189262 transitions. [2019-09-10 09:01:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:01:37,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 09:01:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:38,968 INFO L225 Difference]: With dead ends: 742227 [2019-09-10 09:01:38,968 INFO L226 Difference]: Without dead ends: 742227 [2019-09-10 09:01:38,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:01:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742227 states. [2019-09-10 09:01:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742227 to 449257. [2019-09-10 09:01:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449257 states. [2019-09-10 09:01:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449257 states to 449257 states and 720468 transitions. [2019-09-10 09:01:51,926 INFO L78 Accepts]: Start accepts. Automaton has 449257 states and 720468 transitions. Word has length 144 [2019-09-10 09:01:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:51,926 INFO L475 AbstractCegarLoop]: Abstraction has 449257 states and 720468 transitions. [2019-09-10 09:01:51,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:01:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 449257 states and 720468 transitions. [2019-09-10 09:01:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 09:01:51,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:51,933 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:51,933 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1097787199, now seen corresponding path program 1 times [2019-09-10 09:01:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:51,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:51,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 09:01:52,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:52,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:01:52,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:52,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:01:52,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:01:52,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:01:52,154 INFO L87 Difference]: Start difference. First operand 449257 states and 720468 transitions. Second operand 6 states. [2019-09-10 09:01:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:55,103 INFO L93 Difference]: Finished difference Result 615855 states and 990164 transitions. [2019-09-10 09:01:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:01:55,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 09:01:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:56,029 INFO L225 Difference]: With dead ends: 615855 [2019-09-10 09:01:56,029 INFO L226 Difference]: Without dead ends: 615855 [2019-09-10 09:01:56,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:01:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615855 states. [2019-09-10 09:02:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615855 to 513853. [2019-09-10 09:02:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513853 states. [2019-09-10 09:02:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513853 states to 513853 states and 824544 transitions. [2019-09-10 09:02:11,020 INFO L78 Accepts]: Start accepts. Automaton has 513853 states and 824544 transitions. Word has length 180 [2019-09-10 09:02:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:11,021 INFO L475 AbstractCegarLoop]: Abstraction has 513853 states and 824544 transitions. [2019-09-10 09:02:11,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:02:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 513853 states and 824544 transitions. [2019-09-10 09:02:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 09:02:11,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:11,028 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:11,028 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:11,029 INFO L82 PathProgramCache]: Analyzing trace with hash 785016035, now seen corresponding path program 1 times [2019-09-10 09:02:11,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:11,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:11,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:11,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:11,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 09:02:11,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:11,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:02:11,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:11,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:02:11,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:02:11,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:02:11,265 INFO L87 Difference]: Start difference. First operand 513853 states and 824544 transitions. Second operand 6 states. [2019-09-10 09:02:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:19,056 INFO L93 Difference]: Finished difference Result 672261 states and 1081232 transitions. [2019-09-10 09:02:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:02:19,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 09:02:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:20,121 INFO L225 Difference]: With dead ends: 672261 [2019-09-10 09:02:20,121 INFO L226 Difference]: Without dead ends: 672261 [2019-09-10 09:02:20,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:02:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672261 states. [2019-09-10 09:02:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672261 to 570043. [2019-09-10 09:02:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570043 states. [2019-09-10 09:02:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570043 states to 570043 states and 914988 transitions. [2019-09-10 09:02:35,421 INFO L78 Accepts]: Start accepts. Automaton has 570043 states and 914988 transitions. Word has length 180 [2019-09-10 09:02:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:35,422 INFO L475 AbstractCegarLoop]: Abstraction has 570043 states and 914988 transitions. [2019-09-10 09:02:35,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:02:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 570043 states and 914988 transitions. [2019-09-10 09:02:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 09:02:35,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:35,430 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:35,430 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -339317173, now seen corresponding path program 1 times [2019-09-10 09:02:35,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:35,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:35,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 09:02:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:35,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:02:35,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:35,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:02:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:02:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:02:35,626 INFO L87 Difference]: Start difference. First operand 570043 states and 914988 transitions. Second operand 6 states. [2019-09-10 09:02:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:39,593 INFO L93 Difference]: Finished difference Result 662436 states and 1064202 transitions. [2019-09-10 09:02:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:02:39,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-10 09:02:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:40,648 INFO L225 Difference]: With dead ends: 662436 [2019-09-10 09:02:40,648 INFO L226 Difference]: Without dead ends: 662436 [2019-09-10 09:02:40,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:02:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662436 states. [2019-09-10 09:02:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662436 to 622718. [2019-09-10 09:02:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622718 states. [2019-09-10 09:03:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622718 states to 622718 states and 999511 transitions. [2019-09-10 09:03:09,152 INFO L78 Accepts]: Start accepts. Automaton has 622718 states and 999511 transitions. Word has length 180 [2019-09-10 09:03:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:09,153 INFO L475 AbstractCegarLoop]: Abstraction has 622718 states and 999511 transitions. [2019-09-10 09:03:09,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:03:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 622718 states and 999511 transitions. [2019-09-10 09:03:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 09:03:09,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:09,158 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:03:09,158 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1593145434, now seen corresponding path program 1 times [2019-09-10 09:03:09,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:09,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:09,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:09,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 09:03:09,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:09,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:09,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:09,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:09,280 INFO L87 Difference]: Start difference. First operand 622718 states and 999511 transitions. Second operand 3 states. [2019-09-10 09:03:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:13,794 INFO L93 Difference]: Finished difference Result 1038226 states and 1667300 transitions. [2019-09-10 09:03:13,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:13,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 09:03:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:15,647 INFO L225 Difference]: With dead ends: 1038226 [2019-09-10 09:03:15,647 INFO L226 Difference]: Without dead ends: 1038226 [2019-09-10 09:03:15,647 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-10 09:03:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038226 states. [2019-09-10 09:03:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038226 to 1036823. [2019-09-10 09:03:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036823 states. [2019-09-10 09:03:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036823 states to 1036823 states and 1665898 transitions. [2019-09-10 09:03:50,141 INFO L78 Accepts]: Start accepts. Automaton has 1036823 states and 1665898 transitions. Word has length 181 [2019-09-10 09:03:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:50,142 INFO L475 AbstractCegarLoop]: Abstraction has 1036823 states and 1665898 transitions. [2019-09-10 09:03:50,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1036823 states and 1665898 transitions. [2019-09-10 09:03:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 09:03:50,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:50,147 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:03:50,147 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:50,147 INFO L82 PathProgramCache]: Analyzing trace with hash -394503461, now seen corresponding path program 1 times [2019-09-10 09:03:50,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:50,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:50,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:50,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 09:03:50,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 09:03:50,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-09-10 09:03:50,379 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [252], [255], [258], [261], [263], [266], [271], [293], [296], [299], [301], [303], [343], [383], [427], [430], [433], [436], [439], [442], [449], [457], [459], [462], [463], [465], [474], [477], [488], [491], [501], [525], [528], [574], [584], [594], [604], [626], [629], [675], [685], [695], [705], [727], [730], [776], [786], [796], [806], [816], [820], [824], [826], [828], [831], [877], [887], [897], [907], [1535], [1536], [1540], [1541], [1542] [2019-09-10 09:03:50,453 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 09:03:50,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 09:03:50,653 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 09:03:50,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 09:03:51,000 INFO L272 AbstractInterpreter]: Visited 155 different actions 279 times. Merged at 52 different actions 119 times. Never widened. Performed 1077 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1077 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 294 variables. [2019-09-10 09:03:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:51,005 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 09:03:54,038 INFO L227 lantSequenceWeakener]: Weakened 125 states. On average, predicates are now at 89.52% of their original sizes. [2019-09-10 09:03:54,039 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 09:04:29,313 INFO L420 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2019-09-10 09:04:29,313 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 09:04:29,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 09:04:29,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [9] total 109 [2019-09-10 09:04:29,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:29,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-10 09:04:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-10 09:04:29,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1619, Invalid=8683, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 09:04:29,319 INFO L87 Difference]: Start difference. First operand 1036823 states and 1665898 transitions. Second operand 102 states.