java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:26,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:26,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:26,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:26,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:26,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:26,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:26,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:26,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:26,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:26,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:26,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:26,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:26,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:26,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:26,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:26,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:26,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:26,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:26,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:26,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:26,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:26,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:26,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:26,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:26,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:26,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:26,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:26,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:26,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:26,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:26,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:26,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:26,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:26,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:26,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:26,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:26,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:26,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:26,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:26,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:26,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:26,542 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:26,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:26,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:26,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:26,544 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:26,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:26,544 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:26,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:26,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:26,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:26,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:26,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:26,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:26,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:26,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:26,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:26,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:26,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:26,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:26,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:26,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:26,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:26,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:26,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:26,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:26,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:26,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:26,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:26,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:26,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:26,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:26,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:26,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:26,842 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:26,842 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 01:23:26,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31936a90d/cefa3f947ec74278baf2e6bc328e1c38/FLAG19eba0ed5 [2019-10-15 01:23:27,438 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:27,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 01:23:27,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31936a90d/cefa3f947ec74278baf2e6bc328e1c38/FLAG19eba0ed5 [2019-10-15 01:23:27,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31936a90d/cefa3f947ec74278baf2e6bc328e1c38 [2019-10-15 01:23:27,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:27,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:27,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:27,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:27,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:27,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:27" (1/1) ... [2019-10-15 01:23:27,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63dd5b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:27, skipping insertion in model container [2019-10-15 01:23:27,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:27" (1/1) ... [2019-10-15 01:23:27,783 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:27,832 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:28,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:28,242 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:28,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:28,349 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:28,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28 WrapperNode [2019-10-15 01:23:28,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:28,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:28,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:28,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:28,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (1/1) ... [2019-10-15 01:23:28,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (1/1) ... [2019-10-15 01:23:28,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (1/1) ... [2019-10-15 01:23:28,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (1/1) ... [2019-10-15 01:23:28,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (1/1) ... [2019-10-15 01:23:28,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (1/1) ... [2019-10-15 01:23:28,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (1/1) ... [2019-10-15 01:23:28,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:28,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:28,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:28,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:28,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (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-10-15 01:23:28,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:28,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:28,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:29,241 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:29,242 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:29,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:29 BoogieIcfgContainer [2019-10-15 01:23:29,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:29,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:29,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:29,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:29,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:27" (1/3) ... [2019-10-15 01:23:29,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bf14d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:29, skipping insertion in model container [2019-10-15 01:23:29,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:28" (2/3) ... [2019-10-15 01:23:29,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bf14d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:29, skipping insertion in model container [2019-10-15 01:23:29,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:29" (3/3) ... [2019-10-15 01:23:29,259 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 01:23:29,269 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:29,278 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:29,288 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:29,312 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:29,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:29,312 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:29,312 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:29,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:29,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:29,313 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:29,313 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-15 01:23:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:29,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:29,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:29,347 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1085569870, now seen corresponding path program 1 times [2019-10-15 01:23:29,358 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:29,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412104344] [2019-10-15 01:23:29,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:29,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412104344] [2019-10-15 01:23:29,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:29,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:29,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042679234] [2019-10-15 01:23:29,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:29,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:29,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:29,834 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-10-15 01:23:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:30,003 INFO L93 Difference]: Finished difference Result 342 states and 566 transitions. [2019-10-15 01:23:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:30,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:23:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:30,024 INFO L225 Difference]: With dead ends: 342 [2019-10-15 01:23:30,024 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 01:23:30,028 INFO L600 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-10-15 01:23:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 01:23:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-10-15 01:23:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:23:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 363 transitions. [2019-10-15 01:23:30,096 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 363 transitions. Word has length 60 [2019-10-15 01:23:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:30,098 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 363 transitions. [2019-10-15 01:23:30,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 363 transitions. [2019-10-15 01:23:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:23:30,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:30,103 INFO L380 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] [2019-10-15 01:23:30,103 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1093309265, now seen corresponding path program 1 times [2019-10-15 01:23:30,104 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:30,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112758788] [2019-10-15 01:23:30,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:30,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112758788] [2019-10-15 01:23:30,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:30,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:30,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482241784] [2019-10-15 01:23:30,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:30,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:30,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:30,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:30,327 INFO L87 Difference]: Start difference. First operand 232 states and 363 transitions. Second operand 3 states. [2019-10-15 01:23:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:30,426 INFO L93 Difference]: Finished difference Result 570 states and 915 transitions. [2019-10-15 01:23:30,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:30,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-15 01:23:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:30,437 INFO L225 Difference]: With dead ends: 570 [2019-10-15 01:23:30,437 INFO L226 Difference]: Without dead ends: 393 [2019-10-15 01:23:30,440 INFO L600 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-10-15 01:23:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-15 01:23:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2019-10-15 01:23:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-15 01:23:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 618 transitions. [2019-10-15 01:23:30,482 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 618 transitions. Word has length 62 [2019-10-15 01:23:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:30,482 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 618 transitions. [2019-10-15 01:23:30,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 618 transitions. [2019-10-15 01:23:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 01:23:30,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:30,485 INFO L380 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] [2019-10-15 01:23:30,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash 647852560, now seen corresponding path program 1 times [2019-10-15 01:23:30,486 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:30,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372623786] [2019-10-15 01:23:30,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:30,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372623786] [2019-10-15 01:23:30,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:30,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:30,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793445435] [2019-10-15 01:23:30,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:30,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:30,602 INFO L87 Difference]: Start difference. First operand 389 states and 618 transitions. Second operand 3 states. [2019-10-15 01:23:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:30,685 INFO L93 Difference]: Finished difference Result 1025 states and 1652 transitions. [2019-10-15 01:23:30,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:30,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-15 01:23:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:30,692 INFO L225 Difference]: With dead ends: 1025 [2019-10-15 01:23:30,692 INFO L226 Difference]: Without dead ends: 691 [2019-10-15 01:23:30,695 INFO L600 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-10-15 01:23:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-15 01:23:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 685. [2019-10-15 01:23:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-15 01:23:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1094 transitions. [2019-10-15 01:23:30,762 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1094 transitions. Word has length 64 [2019-10-15 01:23:30,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:30,763 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1094 transitions. [2019-10-15 01:23:30,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1094 transitions. [2019-10-15 01:23:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-15 01:23:30,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:30,773 INFO L380 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-10-15 01:23:30,774 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash -971934415, now seen corresponding path program 1 times [2019-10-15 01:23:30,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:30,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925043593] [2019-10-15 01:23:30,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:30,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925043593] [2019-10-15 01:23:30,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:30,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:30,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566148162] [2019-10-15 01:23:30,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:30,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:30,969 INFO L87 Difference]: Start difference. First operand 685 states and 1094 transitions. Second operand 5 states. [2019-10-15 01:23:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:31,176 INFO L93 Difference]: Finished difference Result 2313 states and 3756 transitions. [2019-10-15 01:23:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:31,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-15 01:23:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:31,186 INFO L225 Difference]: With dead ends: 2313 [2019-10-15 01:23:31,186 INFO L226 Difference]: Without dead ends: 1683 [2019-10-15 01:23:31,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-10-15 01:23:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1500. [2019-10-15 01:23:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-10-15 01:23:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2423 transitions. [2019-10-15 01:23:31,265 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2423 transitions. Word has length 66 [2019-10-15 01:23:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:31,265 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 2423 transitions. [2019-10-15 01:23:31,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2423 transitions. [2019-10-15 01:23:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 01:23:31,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:31,267 INFO L380 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-10-15 01:23:31,268 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:31,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:31,268 INFO L82 PathProgramCache]: Analyzing trace with hash -126806256, now seen corresponding path program 1 times [2019-10-15 01:23:31,268 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:31,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819834892] [2019-10-15 01:23:31,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:31,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:31,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:31,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819834892] [2019-10-15 01:23:31,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:31,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:31,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183713247] [2019-10-15 01:23:31,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:31,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:31,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:31,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:31,368 INFO L87 Difference]: Start difference. First operand 1500 states and 2423 transitions. Second operand 6 states. [2019-10-15 01:23:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:31,752 INFO L93 Difference]: Finished difference Result 5957 states and 9657 transitions. [2019-10-15 01:23:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:31,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-15 01:23:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:31,777 INFO L225 Difference]: With dead ends: 5957 [2019-10-15 01:23:31,777 INFO L226 Difference]: Without dead ends: 4512 [2019-10-15 01:23:31,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-10-15 01:23:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4409. [2019-10-15 01:23:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-10-15 01:23:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 7126 transitions. [2019-10-15 01:23:32,008 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 7126 transitions. Word has length 67 [2019-10-15 01:23:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:32,009 INFO L462 AbstractCegarLoop]: Abstraction has 4409 states and 7126 transitions. [2019-10-15 01:23:32,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 7126 transitions. [2019-10-15 01:23:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 01:23:32,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:32,012 INFO L380 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-10-15 01:23:32,012 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 306920920, now seen corresponding path program 1 times [2019-10-15 01:23:32,013 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:32,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846063518] [2019-10-15 01:23:32,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:32,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:32,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:32,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846063518] [2019-10-15 01:23:32,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:32,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:32,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066987759] [2019-10-15 01:23:32,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:32,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:32,161 INFO L87 Difference]: Start difference. First operand 4409 states and 7126 transitions. Second operand 4 states. [2019-10-15 01:23:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:32,497 INFO L93 Difference]: Finished difference Result 10298 states and 16697 transitions. [2019-10-15 01:23:32,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:32,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-15 01:23:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:32,546 INFO L225 Difference]: With dead ends: 10298 [2019-10-15 01:23:32,547 INFO L226 Difference]: Without dead ends: 6343 [2019-10-15 01:23:32,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-10-15 01:23:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 6316. [2019-10-15 01:23:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-10-15 01:23:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 10205 transitions. [2019-10-15 01:23:32,992 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 10205 transitions. Word has length 68 [2019-10-15 01:23:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:32,993 INFO L462 AbstractCegarLoop]: Abstraction has 6316 states and 10205 transitions. [2019-10-15 01:23:32,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 10205 transitions. [2019-10-15 01:23:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-15 01:23:32,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:32,995 INFO L380 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-10-15 01:23:32,995 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:32,996 INFO L82 PathProgramCache]: Analyzing trace with hash 872119511, now seen corresponding path program 1 times [2019-10-15 01:23:32,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:32,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961394560] [2019-10-15 01:23:32,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:32,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:32,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:33,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961394560] [2019-10-15 01:23:33,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:33,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:33,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150147238] [2019-10-15 01:23:33,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:33,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:33,082 INFO L87 Difference]: Start difference. First operand 6316 states and 10205 transitions. Second operand 4 states. [2019-10-15 01:23:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:33,820 INFO L93 Difference]: Finished difference Result 18451 states and 29920 transitions. [2019-10-15 01:23:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:33,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-10-15 01:23:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:33,931 INFO L225 Difference]: With dead ends: 18451 [2019-10-15 01:23:33,932 INFO L226 Difference]: Without dead ends: 12686 [2019-10-15 01:23:33,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12686 states. [2019-10-15 01:23:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12686 to 8636. [2019-10-15 01:23:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2019-10-15 01:23:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 13951 transitions. [2019-10-15 01:23:34,907 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 13951 transitions. Word has length 69 [2019-10-15 01:23:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:34,908 INFO L462 AbstractCegarLoop]: Abstraction has 8636 states and 13951 transitions. [2019-10-15 01:23:34,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 13951 transitions. [2019-10-15 01:23:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:23:34,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:34,911 INFO L380 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-10-15 01:23:34,911 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1806428220, now seen corresponding path program 1 times [2019-10-15 01:23:34,912 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:34,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062002543] [2019-10-15 01:23:34,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:34,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062002543] [2019-10-15 01:23:34,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:34,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:34,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228573545] [2019-10-15 01:23:34,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:34,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:34,986 INFO L87 Difference]: Start difference. First operand 8636 states and 13951 transitions. Second operand 3 states. [2019-10-15 01:23:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:35,550 INFO L93 Difference]: Finished difference Result 19227 states and 31095 transitions. [2019-10-15 01:23:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:35,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-15 01:23:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:35,586 INFO L225 Difference]: With dead ends: 19227 [2019-10-15 01:23:35,587 INFO L226 Difference]: Without dead ends: 12825 [2019-10-15 01:23:35,603 INFO L600 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-10-15 01:23:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12825 states. [2019-10-15 01:23:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12825 to 12823. [2019-10-15 01:23:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12823 states. [2019-10-15 01:23:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12823 states to 12823 states and 20604 transitions. [2019-10-15 01:23:36,345 INFO L78 Accepts]: Start accepts. Automaton has 12823 states and 20604 transitions. Word has length 70 [2019-10-15 01:23:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:36,346 INFO L462 AbstractCegarLoop]: Abstraction has 12823 states and 20604 transitions. [2019-10-15 01:23:36,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 12823 states and 20604 transitions. [2019-10-15 01:23:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:23:36,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:36,348 INFO L380 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-10-15 01:23:36,348 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash -552777714, now seen corresponding path program 1 times [2019-10-15 01:23:36,349 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:36,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394696374] [2019-10-15 01:23:36,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:36,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:36,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:36,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394696374] [2019-10-15 01:23:36,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:36,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:36,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114022740] [2019-10-15 01:23:36,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:36,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:36,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:36,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:36,422 INFO L87 Difference]: Start difference. First operand 12823 states and 20604 transitions. Second operand 3 states. [2019-10-15 01:23:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,199 INFO L93 Difference]: Finished difference Result 27737 states and 44670 transitions. [2019-10-15 01:23:37,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:37,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-15 01:23:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:37,246 INFO L225 Difference]: With dead ends: 27737 [2019-10-15 01:23:37,247 INFO L226 Difference]: Without dead ends: 18500 [2019-10-15 01:23:37,269 INFO L600 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-10-15 01:23:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18500 states. [2019-10-15 01:23:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18500 to 18498. [2019-10-15 01:23:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18498 states. [2019-10-15 01:23:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 29596 transitions. [2019-10-15 01:23:38,662 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 29596 transitions. Word has length 70 [2019-10-15 01:23:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:38,662 INFO L462 AbstractCegarLoop]: Abstraction has 18498 states and 29596 transitions. [2019-10-15 01:23:38,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 29596 transitions. [2019-10-15 01:23:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:23:38,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:38,664 INFO L380 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-10-15 01:23:38,664 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1170468960, now seen corresponding path program 1 times [2019-10-15 01:23:38,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:38,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112468843] [2019-10-15 01:23:38,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:38,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112468843] [2019-10-15 01:23:38,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:38,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:38,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024525456] [2019-10-15 01:23:38,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:38,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:38,732 INFO L87 Difference]: Start difference. First operand 18498 states and 29596 transitions. Second operand 3 states. [2019-10-15 01:23:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:39,493 INFO L93 Difference]: Finished difference Result 42427 states and 68162 transitions. [2019-10-15 01:23:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:39,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-15 01:23:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:39,557 INFO L225 Difference]: With dead ends: 42427 [2019-10-15 01:23:39,558 INFO L226 Difference]: Without dead ends: 27744 [2019-10-15 01:23:39,592 INFO L600 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-10-15 01:23:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27744 states. [2019-10-15 01:23:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27744 to 27742. [2019-10-15 01:23:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-10-15 01:23:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44151 transitions. [2019-10-15 01:23:40,686 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44151 transitions. Word has length 70 [2019-10-15 01:23:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:40,686 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 44151 transitions. [2019-10-15 01:23:40,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44151 transitions. [2019-10-15 01:23:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-15 01:23:40,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:40,688 INFO L380 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-10-15 01:23:40,688 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash -901408249, now seen corresponding path program 1 times [2019-10-15 01:23:40,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:40,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428467794] [2019-10-15 01:23:40,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:40,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:40,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:40,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428467794] [2019-10-15 01:23:40,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:40,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:40,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637247048] [2019-10-15 01:23:40,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:40,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:40,822 INFO L87 Difference]: Start difference. First operand 27742 states and 44151 transitions. Second operand 5 states. [2019-10-15 01:23:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:41,779 INFO L93 Difference]: Finished difference Result 57487 states and 91562 transitions. [2019-10-15 01:23:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:41,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-15 01:23:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:41,868 INFO L225 Difference]: With dead ends: 57487 [2019-10-15 01:23:41,869 INFO L226 Difference]: Without dead ends: 29834 [2019-10-15 01:23:41,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29834 states. [2019-10-15 01:23:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29834 to 27742. [2019-10-15 01:23:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-10-15 01:23:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44016 transitions. [2019-10-15 01:23:43,587 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44016 transitions. Word has length 71 [2019-10-15 01:23:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:43,587 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 44016 transitions. [2019-10-15 01:23:43,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44016 transitions. [2019-10-15 01:23:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 01:23:43,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:43,588 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:43,588 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 527849417, now seen corresponding path program 1 times [2019-10-15 01:23:43,589 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:43,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258430861] [2019-10-15 01:23:43,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:43,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258430861] [2019-10-15 01:23:43,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:43,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:43,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430587902] [2019-10-15 01:23:43,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:43,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:43,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:43,752 INFO L87 Difference]: Start difference. First operand 27742 states and 44016 transitions. Second operand 5 states. [2019-10-15 01:23:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:45,779 INFO L93 Difference]: Finished difference Result 89911 states and 143015 transitions. [2019-10-15 01:23:45,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:45,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-15 01:23:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:45,879 INFO L225 Difference]: With dead ends: 89911 [2019-10-15 01:23:45,879 INFO L226 Difference]: Without dead ends: 62258 [2019-10-15 01:23:45,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62258 states. [2019-10-15 01:23:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62258 to 38998. [2019-10-15 01:23:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38998 states. [2019-10-15 01:23:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38998 states to 38998 states and 61670 transitions. [2019-10-15 01:23:48,331 INFO L78 Accepts]: Start accepts. Automaton has 38998 states and 61670 transitions. Word has length 74 [2019-10-15 01:23:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:48,332 INFO L462 AbstractCegarLoop]: Abstraction has 38998 states and 61670 transitions. [2019-10-15 01:23:48,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 38998 states and 61670 transitions. [2019-10-15 01:23:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-15 01:23:48,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:48,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:48,333 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash -818446556, now seen corresponding path program 1 times [2019-10-15 01:23:48,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:48,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760707072] [2019-10-15 01:23:48,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:48,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760707072] [2019-10-15 01:23:48,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:48,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:48,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552603190] [2019-10-15 01:23:48,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:48,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:48,455 INFO L87 Difference]: Start difference. First operand 38998 states and 61670 transitions. Second operand 5 states. [2019-10-15 01:23:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,333 INFO L93 Difference]: Finished difference Result 68965 states and 108517 transitions. [2019-10-15 01:23:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:23:51,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-15 01:23:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,415 INFO L225 Difference]: With dead ends: 68965 [2019-10-15 01:23:51,415 INFO L226 Difference]: Without dead ends: 68963 [2019-10-15 01:23:51,432 INFO L600 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-10-15 01:23:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68963 states. [2019-10-15 01:23:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68963 to 39854. [2019-10-15 01:23:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39854 states. [2019-10-15 01:23:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39854 states to 39854 states and 62517 transitions. [2019-10-15 01:23:53,151 INFO L78 Accepts]: Start accepts. Automaton has 39854 states and 62517 transitions. Word has length 75 [2019-10-15 01:23:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,151 INFO L462 AbstractCegarLoop]: Abstraction has 39854 states and 62517 transitions. [2019-10-15 01:23:53,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39854 states and 62517 transitions. [2019-10-15 01:23:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:23:53,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,154 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:53,155 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash -886490076, now seen corresponding path program 1 times [2019-10-15 01:23:53,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015076343] [2019-10-15 01:23:53,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:53,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015076343] [2019-10-15 01:23:53,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821833032] [2019-10-15 01:23:53,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,237 INFO L87 Difference]: Start difference. First operand 39854 states and 62517 transitions. Second operand 3 states. [2019-10-15 01:23:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,013 INFO L93 Difference]: Finished difference Result 73854 states and 116239 transitions. [2019-10-15 01:23:55,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:55,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-15 01:23:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,054 INFO L225 Difference]: With dead ends: 73854 [2019-10-15 01:23:55,055 INFO L226 Difference]: Without dead ends: 34089 [2019-10-15 01:23:55,094 INFO L600 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-10-15 01:23:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34089 states. [2019-10-15 01:23:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34089 to 34087. [2019-10-15 01:23:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34087 states. [2019-10-15 01:23:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34087 states to 34087 states and 53532 transitions. [2019-10-15 01:23:57,395 INFO L78 Accepts]: Start accepts. Automaton has 34087 states and 53532 transitions. Word has length 101 [2019-10-15 01:23:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,395 INFO L462 AbstractCegarLoop]: Abstraction has 34087 states and 53532 transitions. [2019-10-15 01:23:57,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 34087 states and 53532 transitions. [2019-10-15 01:23:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:23:57,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,397 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:57,398 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1522449336, now seen corresponding path program 1 times [2019-10-15 01:23:57,398 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875836722] [2019-10-15 01:23:57,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:57,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875836722] [2019-10-15 01:23:57,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:57,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203414465] [2019-10-15 01:23:57,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:57,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:57,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,477 INFO L87 Difference]: Start difference. First operand 34087 states and 53532 transitions. Second operand 3 states. [2019-10-15 01:23:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,028 INFO L93 Difference]: Finished difference Result 47480 states and 74651 transitions. [2019-10-15 01:23:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:58,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-15 01:23:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,044 INFO L225 Difference]: With dead ends: 47480 [2019-10-15 01:23:58,044 INFO L226 Difference]: Without dead ends: 13512 [2019-10-15 01:23:58,068 INFO L600 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-10-15 01:23:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13512 states. [2019-10-15 01:23:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13512 to 13510. [2019-10-15 01:23:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13510 states. [2019-10-15 01:23:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13510 states to 13510 states and 21152 transitions. [2019-10-15 01:23:58,805 INFO L78 Accepts]: Start accepts. Automaton has 13510 states and 21152 transitions. Word has length 101 [2019-10-15 01:23:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:58,805 INFO L462 AbstractCegarLoop]: Abstraction has 13510 states and 21152 transitions. [2019-10-15 01:23:58,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 13510 states and 21152 transitions. [2019-10-15 01:23:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:23:58,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:58,807 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:58,807 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1365075631, now seen corresponding path program 1 times [2019-10-15 01:23:58,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:58,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699715237] [2019-10-15 01:23:58,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:58,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699715237] [2019-10-15 01:23:58,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958067306] [2019-10-15 01:23:58,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:23:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:59,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:23:59,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:23:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:23:59,231 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:23:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:23:59,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:23:59,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-15 01:23:59,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066117507] [2019-10-15 01:23:59,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:59,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:59,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:59,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:59,307 INFO L87 Difference]: Start difference. First operand 13510 states and 21152 transitions. Second operand 5 states.