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_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:16:02,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:16:02,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:16:02,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:16:02,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:16:02,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:16:02,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:16:02,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:16:02,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:16:02,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:16:02,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:16:02,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:16:02,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:16:02,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:16:02,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:16:02,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:16:02,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:16:02,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:16:02,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:16:02,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:16:02,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:16:02,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:16:02,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:16:02,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:16:02,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:16:02,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:16:02,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:16:02,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:16:02,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:16:02,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:16:02,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:16:02,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:16:02,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:16:02,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:16:02,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:16:02,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:16:02,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:16:02,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:16:02,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:16:02,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:16:02,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:16:02,609 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 07:16:02,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:16:02,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:16:02,625 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:16:02,625 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:16:02,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:16:02,626 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:16:02,626 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:16:02,627 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:16:02,627 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:16:02,627 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:16:02,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:16:02,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:16:02,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:16:02,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:16:02,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:16:02,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:16:02,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:16:02,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:16:02,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:16:02,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:16:02,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:16:02,630 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:16:02,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:16:02,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:16:02,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:16:02,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:16:02,631 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:16:02,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:16:02,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:16:02,632 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:16:02,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:16:02,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:16:02,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:16:02,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:16:02,692 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:16:02,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:16:02,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ec4b9ca/cc0a7475ef5d4e9984b6dd6bd45ed58a/FLAGa888f9ac1 [2019-09-10 07:16:03,218 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:16:03,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:16:03,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ec4b9ca/cc0a7475ef5d4e9984b6dd6bd45ed58a/FLAGa888f9ac1 [2019-09-10 07:16:03,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43ec4b9ca/cc0a7475ef5d4e9984b6dd6bd45ed58a [2019-09-10 07:16:03,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:16:03,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:16:03,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:16:03,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:16:03,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:16:03,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:16:03" (1/1) ... [2019-09-10 07:16:03,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:03, skipping insertion in model container [2019-09-10 07:16:03,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:16:03" (1/1) ... [2019-09-10 07:16:03,625 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:16:03,672 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:16:04,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:16:04,183 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:16:04,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:16:04,308 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:16:04,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04 WrapperNode [2019-09-10 07:16:04,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:16:04,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:16:04,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:16:04,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:16:04,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (1/1) ... [2019-09-10 07:16:04,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:16:04,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:16:04,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:16:04,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:16:04,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (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 07:16:04,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:16:04,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:16:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:16:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:16:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:16:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:16:04,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:16:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:16:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:16:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:16:04,454 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:16:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:16:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:16:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:16:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:16:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:16:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:16:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:16:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:16:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:16:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:16:05,203 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:16:05,204 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:16:05,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:16:05 BoogieIcfgContainer [2019-09-10 07:16:05,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:16:05,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:16:05,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:16:05,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:16:05,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:16:03" (1/3) ... [2019-09-10 07:16:05,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e16f341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:16:05, skipping insertion in model container [2019-09-10 07:16:05,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:16:04" (2/3) ... [2019-09-10 07:16:05,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e16f341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:16:05, skipping insertion in model container [2019-09-10 07:16:05,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:16:05" (3/3) ... [2019-09-10 07:16:05,220 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:16:05,230 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:16:05,252 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:16:05,269 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:16:05,303 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:16:05,303 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:16:05,304 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:16:05,304 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:16:05,304 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:16:05,304 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:16:05,304 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:16:05,305 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:16:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-10 07:16:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:16:05,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:05,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:05,366 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:05,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash -34788824, now seen corresponding path program 1 times [2019-09-10 07:16:05,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:05,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:05,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:05,848 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 07:16:05,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:05,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:05,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:05,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:05,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:05,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:05,883 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-10 07:16:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:05,954 INFO L93 Difference]: Finished difference Result 231 states and 369 transitions. [2019-09-10 07:16:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:05,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:16:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:06,002 INFO L225 Difference]: With dead ends: 231 [2019-09-10 07:16:06,003 INFO L226 Difference]: Without dead ends: 223 [2019-09-10 07:16:06,005 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 07:16:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-10 07:16:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-10 07:16:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:16:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 329 transitions. [2019-09-10 07:16:06,076 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 329 transitions. Word has length 65 [2019-09-10 07:16:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:06,076 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 329 transitions. [2019-09-10 07:16:06,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 329 transitions. [2019-09-10 07:16:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:16:06,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:06,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:06,080 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1987070288, now seen corresponding path program 1 times [2019-09-10 07:16:06,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:06,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:06,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:06,230 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 07:16:06,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:06,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:06,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:06,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:06,235 INFO L87 Difference]: Start difference. First operand 221 states and 329 transitions. Second operand 3 states. [2019-09-10 07:16:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:06,284 INFO L93 Difference]: Finished difference Result 371 states and 565 transitions. [2019-09-10 07:16:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:06,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:16:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:06,288 INFO L225 Difference]: With dead ends: 371 [2019-09-10 07:16:06,288 INFO L226 Difference]: Without dead ends: 371 [2019-09-10 07:16:06,289 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 07:16:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-10 07:16:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2019-09-10 07:16:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-10 07:16:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2019-09-10 07:16:06,314 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 66 [2019-09-10 07:16:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:06,314 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2019-09-10 07:16:06,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2019-09-10 07:16:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:16:06,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:06,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:06,318 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash 612521917, now seen corresponding path program 1 times [2019-09-10 07:16:06,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:06,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:06,426 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 07:16:06,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:06,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:06,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:06,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:06,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:06,432 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand 3 states. [2019-09-10 07:16:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:06,464 INFO L93 Difference]: Finished difference Result 635 states and 981 transitions. [2019-09-10 07:16:06,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:06,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 07:16:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:06,470 INFO L225 Difference]: With dead ends: 635 [2019-09-10 07:16:06,471 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 07:16:06,471 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 07:16:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 07:16:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-10 07:16:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-10 07:16:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 980 transitions. [2019-09-10 07:16:06,520 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 980 transitions. Word has length 67 [2019-09-10 07:16:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:06,521 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 980 transitions. [2019-09-10 07:16:06,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 980 transitions. [2019-09-10 07:16:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:16:06,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:06,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:06,526 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1025177521, now seen corresponding path program 1 times [2019-09-10 07:16:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:06,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:06,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:06,637 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 07:16:06,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:06,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:06,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:06,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:06,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:06,638 INFO L87 Difference]: Start difference. First operand 633 states and 980 transitions. Second operand 3 states. [2019-09-10 07:16:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:06,664 INFO L93 Difference]: Finished difference Result 1099 states and 1705 transitions. [2019-09-10 07:16:06,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:06,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 07:16:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:06,672 INFO L225 Difference]: With dead ends: 1099 [2019-09-10 07:16:06,672 INFO L226 Difference]: Without dead ends: 1099 [2019-09-10 07:16:06,672 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 07:16:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-10 07:16:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2019-09-10 07:16:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-09-10 07:16:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1704 transitions. [2019-09-10 07:16:06,703 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1704 transitions. Word has length 68 [2019-09-10 07:16:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:06,704 INFO L475 AbstractCegarLoop]: Abstraction has 1097 states and 1704 transitions. [2019-09-10 07:16:06,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1704 transitions. [2019-09-10 07:16:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:16:06,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:06,705 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] [2019-09-10 07:16:06,706 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880858, now seen corresponding path program 1 times [2019-09-10 07:16:06,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:06,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:06,927 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 07:16:06,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:06,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:06,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:06,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:06,930 INFO L87 Difference]: Start difference. First operand 1097 states and 1704 transitions. Second operand 7 states. [2019-09-10 07:16:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:07,150 INFO L93 Difference]: Finished difference Result 4609 states and 7164 transitions. [2019-09-10 07:16:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:16:07,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-10 07:16:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:07,174 INFO L225 Difference]: With dead ends: 4609 [2019-09-10 07:16:07,175 INFO L226 Difference]: Without dead ends: 4609 [2019-09-10 07:16:07,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2019-09-10 07:16:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4601. [2019-09-10 07:16:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2019-09-10 07:16:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 7160 transitions. [2019-09-10 07:16:07,280 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 7160 transitions. Word has length 69 [2019-09-10 07:16:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:07,280 INFO L475 AbstractCegarLoop]: Abstraction has 4601 states and 7160 transitions. [2019-09-10 07:16:07,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:16:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 7160 transitions. [2019-09-10 07:16:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:16:07,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:07,285 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] [2019-09-10 07:16:07,285 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:07,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1707189843, now seen corresponding path program 1 times [2019-09-10 07:16:07,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:07,380 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 07:16:07,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:07,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:07,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:07,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:07,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:07,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:07,383 INFO L87 Difference]: Start difference. First operand 4601 states and 7160 transitions. Second operand 3 states. [2019-09-10 07:16:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:07,472 INFO L93 Difference]: Finished difference Result 7803 states and 12009 transitions. [2019-09-10 07:16:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:07,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 07:16:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:07,520 INFO L225 Difference]: With dead ends: 7803 [2019-09-10 07:16:07,520 INFO L226 Difference]: Without dead ends: 7803 [2019-09-10 07:16:07,521 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 07:16:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2019-09-10 07:16:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7801. [2019-09-10 07:16:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7801 states. [2019-09-10 07:16:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 12008 transitions. [2019-09-10 07:16:07,793 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 12008 transitions. Word has length 70 [2019-09-10 07:16:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:07,798 INFO L475 AbstractCegarLoop]: Abstraction has 7801 states and 12008 transitions. [2019-09-10 07:16:07,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 12008 transitions. [2019-09-10 07:16:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:16:07,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:07,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:07,812 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -453623555, now seen corresponding path program 1 times [2019-09-10 07:16:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:07,892 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 07:16:07,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:07,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:07,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:07,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:07,894 INFO L87 Difference]: Start difference. First operand 7801 states and 12008 transitions. Second operand 5 states. [2019-09-10 07:16:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:08,253 INFO L93 Difference]: Finished difference Result 14203 states and 21753 transitions. [2019-09-10 07:16:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:08,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:16:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:08,362 INFO L225 Difference]: With dead ends: 14203 [2019-09-10 07:16:08,362 INFO L226 Difference]: Without dead ends: 14203 [2019-09-10 07:16:08,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14203 states. [2019-09-10 07:16:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14203 to 14201. [2019-09-10 07:16:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14201 states. [2019-09-10 07:16:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14201 states to 14201 states and 21752 transitions. [2019-09-10 07:16:08,863 INFO L78 Accepts]: Start accepts. Automaton has 14201 states and 21752 transitions. Word has length 71 [2019-09-10 07:16:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:08,863 INFO L475 AbstractCegarLoop]: Abstraction has 14201 states and 21752 transitions. [2019-09-10 07:16:08,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14201 states and 21752 transitions. [2019-09-10 07:16:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:16:08,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:08,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:08,865 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1163881336, now seen corresponding path program 1 times [2019-09-10 07:16:08,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:08,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:08,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:08,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:08,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:09,029 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 07:16:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:16:09,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:09,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:16:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:16:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:16:09,031 INFO L87 Difference]: Start difference. First operand 14201 states and 21752 transitions. Second operand 7 states. [2019-09-10 07:16:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:09,436 INFO L93 Difference]: Finished difference Result 61331 states and 93517 transitions. [2019-09-10 07:16:09,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:16:09,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:16:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:09,597 INFO L225 Difference]: With dead ends: 61331 [2019-09-10 07:16:09,598 INFO L226 Difference]: Without dead ends: 61331 [2019-09-10 07:16:09,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61331 states. [2019-09-10 07:16:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61331 to 28361. [2019-09-10 07:16:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28361 states. [2019-09-10 07:16:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28361 states to 28361 states and 42888 transitions. [2019-09-10 07:16:11,008 INFO L78 Accepts]: Start accepts. Automaton has 28361 states and 42888 transitions. Word has length 71 [2019-09-10 07:16:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:11,009 INFO L475 AbstractCegarLoop]: Abstraction has 28361 states and 42888 transitions. [2019-09-10 07:16:11,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:16:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28361 states and 42888 transitions. [2019-09-10 07:16:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:16:11,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:11,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:11,011 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1702050330, now seen corresponding path program 1 times [2019-09-10 07:16:11,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:11,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:11,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:11,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:11,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:16:11,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:11,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:16:11,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:16:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:16:11,103 INFO L87 Difference]: Start difference. First operand 28361 states and 42888 transitions. Second operand 5 states. [2019-09-10 07:16:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:11,283 INFO L93 Difference]: Finished difference Result 57833 states and 86312 transitions. [2019-09-10 07:16:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:16:11,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:16:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:11,405 INFO L225 Difference]: With dead ends: 57833 [2019-09-10 07:16:11,405 INFO L226 Difference]: Without dead ends: 57833 [2019-09-10 07:16:11,406 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 07:16:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57833 states. [2019-09-10 07:16:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57833 to 29513. [2019-09-10 07:16:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29513 states. [2019-09-10 07:16:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29513 states to 29513 states and 44040 transitions. [2019-09-10 07:16:12,157 INFO L78 Accepts]: Start accepts. Automaton has 29513 states and 44040 transitions. Word has length 72 [2019-09-10 07:16:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:12,158 INFO L475 AbstractCegarLoop]: Abstraction has 29513 states and 44040 transitions. [2019-09-10 07:16:12,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:16:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 29513 states and 44040 transitions. [2019-09-10 07:16:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:16:12,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:12,159 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] [2019-09-10 07:16:12,159 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1233572455, now seen corresponding path program 1 times [2019-09-10 07:16:12,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:12,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:12,230 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 07:16:12,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:12,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:12,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:12,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:12,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:12,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:12,232 INFO L87 Difference]: Start difference. First operand 29513 states and 44040 transitions. Second operand 3 states. [2019-09-10 07:16:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:12,329 INFO L93 Difference]: Finished difference Result 37117 states and 54891 transitions. [2019-09-10 07:16:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:12,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:16:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:12,401 INFO L225 Difference]: With dead ends: 37117 [2019-09-10 07:16:12,401 INFO L226 Difference]: Without dead ends: 37117 [2019-09-10 07:16:12,402 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 07:16:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37117 states. [2019-09-10 07:16:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37117 to 36971. [2019-09-10 07:16:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36971 states. [2019-09-10 07:16:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36971 states to 36971 states and 54746 transitions. [2019-09-10 07:16:13,564 INFO L78 Accepts]: Start accepts. Automaton has 36971 states and 54746 transitions. Word has length 73 [2019-09-10 07:16:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:13,565 INFO L475 AbstractCegarLoop]: Abstraction has 36971 states and 54746 transitions. [2019-09-10 07:16:13,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 36971 states and 54746 transitions. [2019-09-10 07:16:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:16:13,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:13,584 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:13,584 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:13,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash -959843441, now seen corresponding path program 1 times [2019-09-10 07:16:13,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:13,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:13,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:13,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:13,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:13,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:13,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:13,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:13,657 INFO L87 Difference]: Start difference. First operand 36971 states and 54746 transitions. Second operand 3 states. [2019-09-10 07:16:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:13,817 INFO L93 Difference]: Finished difference Result 66414 states and 97709 transitions. [2019-09-10 07:16:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:13,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:16:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:13,918 INFO L225 Difference]: With dead ends: 66414 [2019-09-10 07:16:13,918 INFO L226 Difference]: Without dead ends: 66414 [2019-09-10 07:16:13,918 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 07:16:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66414 states. [2019-09-10 07:16:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66414 to 66412. [2019-09-10 07:16:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66412 states. [2019-09-10 07:16:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66412 states to 66412 states and 97708 transitions. [2019-09-10 07:16:16,018 INFO L78 Accepts]: Start accepts. Automaton has 66412 states and 97708 transitions. Word has length 100 [2019-09-10 07:16:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:16,018 INFO L475 AbstractCegarLoop]: Abstraction has 66412 states and 97708 transitions. [2019-09-10 07:16:16,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 66412 states and 97708 transitions. [2019-09-10 07:16:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:16:16,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:16,043 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:16:16,043 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1995645960, now seen corresponding path program 1 times [2019-09-10 07:16:16,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:16,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:16,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:16,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:16:16,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:16:16,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:16:16,344 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [104], [109], [120], [122], [125], [136], [138], [141], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [202], [207], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [379], [381], [394], [402], [421], [432], [434], [436], [439], [442], [445], [447], [449], [512], [513], [517], [518], [519] [2019-09-10 07:16:16,405 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:16:16,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:16:16,590 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:16:17,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:16:17,081 INFO L272 AbstractInterpreter]: Visited 92 different actions 502 times. Merged at 53 different actions 355 times. Widened at 14 different actions 38 times. Performed 1614 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1614 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 57 fixpoints after 15 different actions. Largest state had 142 variables. [2019-09-10 07:16:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:17,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:16:17,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:16:17,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:16:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:17,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:16:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:17,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:16:17,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:16:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:16:17,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:16:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:16:17,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:16:17,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:16:17,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:16:17,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:16:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:16:17,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:16:17,520 INFO L87 Difference]: Start difference. First operand 66412 states and 97708 transitions. Second operand 12 states. [2019-09-10 07:16:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:26,177 INFO L93 Difference]: Finished difference Result 421802 states and 606087 transitions. [2019-09-10 07:16:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 07:16:26,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-10 07:16:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:29,794 INFO L225 Difference]: With dead ends: 421802 [2019-09-10 07:16:29,795 INFO L226 Difference]: Without dead ends: 421802 [2019-09-10 07:16:29,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2770 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1459, Invalid=6197, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 07:16:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421802 states. [2019-09-10 07:16:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421802 to 174788. [2019-09-10 07:16:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174788 states. [2019-09-10 07:16:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174788 states to 174788 states and 253816 transitions. [2019-09-10 07:16:38,114 INFO L78 Accepts]: Start accepts. Automaton has 174788 states and 253816 transitions. Word has length 100 [2019-09-10 07:16:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:38,115 INFO L475 AbstractCegarLoop]: Abstraction has 174788 states and 253816 transitions. [2019-09-10 07:16:38,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:16:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 174788 states and 253816 transitions. [2019-09-10 07:16:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:16:38,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:38,157 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:16:38,158 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:38,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1839484968, now seen corresponding path program 1 times [2019-09-10 07:16:38,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:38,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:38,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:38,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:38,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:16:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:16:38,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:38,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:16:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:16:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:16:38,274 INFO L87 Difference]: Start difference. First operand 174788 states and 253816 transitions. Second operand 6 states. [2019-09-10 07:16:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:39,445 INFO L93 Difference]: Finished difference Result 492776 states and 709506 transitions. [2019-09-10 07:16:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:16:39,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-10 07:16:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:44,272 INFO L225 Difference]: With dead ends: 492776 [2019-09-10 07:16:44,273 INFO L226 Difference]: Without dead ends: 492776 [2019-09-10 07:16:44,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:16:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492776 states. [2019-09-10 07:16:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492776 to 492772. [2019-09-10 07:16:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492772 states. [2019-09-10 07:16:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492772 states to 492772 states and 709504 transitions. [2019-09-10 07:16:57,216 INFO L78 Accepts]: Start accepts. Automaton has 492772 states and 709504 transitions. Word has length 100 [2019-09-10 07:16:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:57,216 INFO L475 AbstractCegarLoop]: Abstraction has 492772 states and 709504 transitions. [2019-09-10 07:16:57,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:16:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 492772 states and 709504 transitions. [2019-09-10 07:16:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:16:57,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:57,257 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:16:57,257 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash -140781229, now seen corresponding path program 1 times [2019-09-10 07:16:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:57,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:57,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:57,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:57,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:16:57,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:16:57,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:16:57,366 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [128], [131], [136], [138], [141], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [370], [373], [381], [384], [387], [390], [392], [394], [436], [449], [457], [476], [512], [513], [517], [518], [519] [2019-09-10 07:16:57,374 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:16:57,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:16:57,407 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:16:57,559 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:16:57,560 INFO L272 AbstractInterpreter]: Visited 84 different actions 213 times. Merged at 42 different actions 108 times. Widened at 1 different actions 1 times. Performed 857 root evaluator evaluations with a maximum evaluation depth of 6. Performed 857 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:16:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:57,560 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:16:57,913 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 80.13% of their original sizes. [2019-09-10 07:16:57,913 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:17:00,930 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:17:00,930 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:17:00,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:17:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:17:00,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:00,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:17:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:17:00,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2157, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:17:00,934 INFO L87 Difference]: Start difference. First operand 492772 states and 709504 transitions. Second operand 50 states. [2019-09-10 07:19:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:25,459 INFO L93 Difference]: Finished difference Result 1208764 states and 1703031 transitions. [2019-09-10 07:19:25,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 481 states. [2019-09-10 07:19:25,459 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-09-10 07:19:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:27,058 INFO L225 Difference]: With dead ends: 1208764 [2019-09-10 07:19:27,058 INFO L226 Difference]: Without dead ends: 1208764 [2019-09-10 07:19:27,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114081 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=25186, Invalid=221326, Unknown=0, NotChecked=0, Total=246512 [2019-09-10 07:19:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208764 states. [2019-09-10 07:19:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208764 to 627236. [2019-09-10 07:19:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627236 states. [2019-09-10 07:19:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627236 states to 627236 states and 895731 transitions. [2019-09-10 07:19:51,612 INFO L78 Accepts]: Start accepts. Automaton has 627236 states and 895731 transitions. Word has length 100 [2019-09-10 07:19:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:51,613 INFO L475 AbstractCegarLoop]: Abstraction has 627236 states and 895731 transitions. [2019-09-10 07:19:51,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:19:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 627236 states and 895731 transitions. [2019-09-10 07:19:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:19:51,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:51,647 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:19:51,647 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1915515791, now seen corresponding path program 1 times [2019-09-10 07:19:51,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:51,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:51,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:51,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:51,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:51,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:51,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:51,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:51,718 INFO L87 Difference]: Start difference. First operand 627236 states and 895731 transitions. Second operand 3 states. [2019-09-10 07:19:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:55,947 INFO L93 Difference]: Finished difference Result 882963 states and 1249546 transitions. [2019-09-10 07:19:55,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:55,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:19:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:07,242 INFO L225 Difference]: With dead ends: 882963 [2019-09-10 07:20:07,242 INFO L226 Difference]: Without dead ends: 882963 [2019-09-10 07:20:07,243 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 07:20:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882963 states. [2019-09-10 07:20:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882963 to 879081. [2019-09-10 07:20:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879081 states. [2019-09-10 07:20:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879081 states to 879081 states and 1245665 transitions. [2019-09-10 07:20:31,834 INFO L78 Accepts]: Start accepts. Automaton has 879081 states and 1245665 transitions. Word has length 100 [2019-09-10 07:20:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:31,834 INFO L475 AbstractCegarLoop]: Abstraction has 879081 states and 1245665 transitions. [2019-09-10 07:20:31,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:20:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 879081 states and 1245665 transitions. [2019-09-10 07:20:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:20:31,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:31,878 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:20:31,878 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1021331140, now seen corresponding path program 1 times [2019-09-10 07:20:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:31,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:31,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:31,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:20:31,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:20:31,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:20:31,985 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [136], [138], [141], [144], [147], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [317], [320], [328], [331], [334], [337], [339], [341], [379], [381], [394], [402], [421], [436], [449], [457], [476], [512], [513], [517], [518], [519] [2019-09-10 07:20:31,995 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:20:31,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:20:32,019 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:20:32,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:20:32,109 INFO L272 AbstractInterpreter]: Visited 84 different actions 227 times. Merged at 42 different actions 121 times. Widened at 1 different actions 2 times. Performed 886 root evaluator evaluations with a maximum evaluation depth of 6. Performed 886 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 7 different actions. Largest state had 142 variables. [2019-09-10 07:20:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:32,110 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:20:34,198 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 80.22% of their original sizes. [2019-09-10 07:20:34,199 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:20:37,194 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:20:37,194 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:20:37,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:20:37,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:20:37,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:37,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:20:37,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:20:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2159, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:20:37,196 INFO L87 Difference]: Start difference. First operand 879081 states and 1245665 transitions. Second operand 50 states. [2019-09-10 07:22:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:33,708 INFO L93 Difference]: Finished difference Result 1982597 states and 2764586 transitions. [2019-09-10 07:22:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 507 states. [2019-09-10 07:22:33,708 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-09-10 07:22:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:47,950 INFO L225 Difference]: With dead ends: 1982597 [2019-09-10 07:22:47,950 INFO L226 Difference]: Without dead ends: 1982597 [2019-09-10 07:22:47,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126201 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=25815, Invalid=246147, Unknown=0, NotChecked=0, Total=271962 [2019-09-10 07:22:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982597 states. [2019-09-10 07:23:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982597 to 1032299. [2019-09-10 07:23:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032299 states. [2019-09-10 07:23:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032299 states to 1032299 states and 1454462 transitions. [2019-09-10 07:23:27,424 INFO L78 Accepts]: Start accepts. Automaton has 1032299 states and 1454462 transitions. Word has length 100 [2019-09-10 07:23:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:27,424 INFO L475 AbstractCegarLoop]: Abstraction has 1032299 states and 1454462 transitions. [2019-09-10 07:23:27,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:23:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1032299 states and 1454462 transitions. [2019-09-10 07:23:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:23:27,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:27,486 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:23:27,486 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1437596744, now seen corresponding path program 1 times [2019-09-10 07:23:27,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:27,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:27,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:27,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:27,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:27,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:27,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:27,556 INFO L87 Difference]: Start difference. First operand 1032299 states and 1454462 transitions. Second operand 3 states. [2019-09-10 07:23:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:43,471 INFO L93 Difference]: Finished difference Result 1461399 states and 2035141 transitions. [2019-09-10 07:23:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:43,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:23:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:45,271 INFO L225 Difference]: With dead ends: 1461399 [2019-09-10 07:23:45,271 INFO L226 Difference]: Without dead ends: 1461399 [2019-09-10 07:23:45,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461399 states. [2019-09-10 07:24:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461399 to 1424356. [2019-09-10 07:24:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424356 states. [2019-09-10 07:24:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424356 states to 1424356 states and 1988060 transitions. [2019-09-10 07:24:33,194 INFO L78 Accepts]: Start accepts. Automaton has 1424356 states and 1988060 transitions. Word has length 100 [2019-09-10 07:24:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:33,194 INFO L475 AbstractCegarLoop]: Abstraction has 1424356 states and 1988060 transitions. [2019-09-10 07:24:33,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1424356 states and 1988060 transitions. [2019-09-10 07:24:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:24:33,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:33,267 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:24:33,267 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash -40854105, now seen corresponding path program 1 times [2019-09-10 07:24:33,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:33,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:33,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:33,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:24:33,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:24:33,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:24:33,373 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [136], [138], [141], [152], [154], [157], [160], [163], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [264], [267], [275], [278], [281], [284], [286], [288], [326], [328], [341], [349], [368], [379], [381], [394], [402], [421], [436], [449], [457], [476], [512], [513], [517], [518], [519] [2019-09-10 07:24:33,375 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:24:33,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:24:33,391 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:24:33,465 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:24:33,466 INFO L272 AbstractInterpreter]: Visited 84 different actions 231 times. Merged at 42 different actions 123 times. Widened at 3 different actions 4 times. Performed 855 root evaluator evaluations with a maximum evaluation depth of 6. Performed 855 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 12 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:24:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:33,466 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:24:33,575 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 80.3% of their original sizes. [2019-09-10 07:24:33,575 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:24:49,594 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:24:49,594 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:24:49,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:24:49,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:24:49,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:49,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:24:49,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:24:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2159, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:24:49,596 INFO L87 Difference]: Start difference. First operand 1424356 states and 1988060 transitions. Second operand 50 states. [2019-09-10 07:26:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:18,893 INFO L93 Difference]: Finished difference Result 2689954 states and 3725938 transitions. [2019-09-10 07:26:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 423 states. [2019-09-10 07:26:18,893 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-09-10 07:26:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:23,896 INFO L225 Difference]: With dead ends: 2689954 [2019-09-10 07:26:23,896 INFO L226 Difference]: Without dead ends: 2689954 [2019-09-10 07:26:23,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86541 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=18672, Invalid=173610, Unknown=0, NotChecked=0, Total=192282 [2019-09-10 07:26:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689954 states.