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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:44,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:44,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:44,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:44,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:44,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:44,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:44,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:44,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:44,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:44,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:44,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:44,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:44,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:44,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:44,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:44,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:44,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:44,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:44,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:44,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:44,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:44,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:44,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:44,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:44,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:44,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:44,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:44,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:44,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:44,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:44,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:44,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:44,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:44,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:44,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:44,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:44,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:44,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:44,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:44,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:44,539 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:44,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:44,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:44,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:44,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:44,563 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:44,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:44,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:44,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:44,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:44,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:44,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:44,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:44,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:44,566 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:44,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:44,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:44,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:44,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:44,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:44,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:44,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:44,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:44,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:44,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:44,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:44,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:44,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:44,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:44,569 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:44,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:44,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:44,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:44,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:44,877 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:44,878 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.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:23:44,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629d13ac8/c89f724c4d86486bb8aeaa8b101e5cd0/FLAG22deaa1c7 [2019-10-15 01:23:45,589 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:45,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:23:45,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629d13ac8/c89f724c4d86486bb8aeaa8b101e5cd0/FLAG22deaa1c7 [2019-10-15 01:23:45,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629d13ac8/c89f724c4d86486bb8aeaa8b101e5cd0 [2019-10-15 01:23:45,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:45,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:45,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:45,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:45,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:45,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b01dc7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:45, skipping insertion in model container [2019-10-15 01:23:45,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:45" (1/1) ... [2019-10-15 01:23:45,800 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:45,868 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:46,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:46,587 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:47,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:47,056 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:47,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47 WrapperNode [2019-10-15 01:23:47,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:47,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:47,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:47,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:47,074 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:47" (1/1) ... [2019-10-15 01:23:47,074 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:47" (1/1) ... [2019-10-15 01:23:47,118 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:47" (1/1) ... [2019-10-15 01:23:47,121 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:47" (1/1) ... [2019-10-15 01:23:47,177 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:47" (1/1) ... [2019-10-15 01:23:47,210 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:47" (1/1) ... [2019-10-15 01:23:47,222 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:47" (1/1) ... [2019-10-15 01:23:47,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:47,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:47,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:47,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:47,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (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:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:47,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:47,325 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:47,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:47,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:47,328 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:49,265 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:49,266 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:49,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:49 BoogieIcfgContainer [2019-10-15 01:23:49,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:49,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:49,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:49,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:49,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:45" (1/3) ... [2019-10-15 01:23:49,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:49, skipping insertion in model container [2019-10-15 01:23:49,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:47" (2/3) ... [2019-10-15 01:23:49,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:49, skipping insertion in model container [2019-10-15 01:23:49,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:49" (3/3) ... [2019-10-15 01:23:49,277 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:23:49,288 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:49,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:23:49,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:23:49,345 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:49,345 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:49,346 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:49,346 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:49,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:49,346 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:49,346 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:49,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-10-15 01:23:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:23:49,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:49,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,439 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 42890573, now seen corresponding path program 1 times [2019-10-15 01:23:49,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:49,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654531204] [2019-10-15 01:23:49,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:50,478 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:50,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654531204] [2019-10-15 01:23:50,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:50,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:50,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419560335] [2019-10-15 01:23:50,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:50,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:50,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:50,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:50,516 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 4 states. [2019-10-15 01:23:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:50,774 INFO L93 Difference]: Finished difference Result 1212 states and 2155 transitions. [2019-10-15 01:23:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:50,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-15 01:23:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:50,801 INFO L225 Difference]: With dead ends: 1212 [2019-10-15 01:23:50,801 INFO L226 Difference]: Without dead ends: 799 [2019-10-15 01:23:50,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-15 01:23:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2019-10-15 01:23:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-15 01:23:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1109 transitions. [2019-10-15 01:23:50,938 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1109 transitions. Word has length 152 [2019-10-15 01:23:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:50,939 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1109 transitions. [2019-10-15 01:23:50,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1109 transitions. [2019-10-15 01:23:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:23:50,951 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:50,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,952 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash -832663523, now seen corresponding path program 1 times [2019-10-15 01:23:50,954 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:50,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113521873] [2019-10-15 01:23:50,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:51,109 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:51,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113521873] [2019-10-15 01:23:51,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:51,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:51,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476851318] [2019-10-15 01:23:51,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:51,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:51,115 INFO L87 Difference]: Start difference. First operand 773 states and 1109 transitions. Second operand 3 states. [2019-10-15 01:23:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,193 INFO L93 Difference]: Finished difference Result 2273 states and 3257 transitions. [2019-10-15 01:23:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:51,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:23:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,206 INFO L225 Difference]: With dead ends: 2273 [2019-10-15 01:23:51,206 INFO L226 Difference]: Without dead ends: 1532 [2019-10-15 01:23:51,210 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:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-10-15 01:23:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 775. [2019-10-15 01:23:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-10-15 01:23:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1111 transitions. [2019-10-15 01:23:51,262 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1111 transitions. Word has length 153 [2019-10-15 01:23:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:51,262 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1111 transitions. [2019-10-15 01:23:51,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1111 transitions. [2019-10-15 01:23:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:51,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1878298894, now seen corresponding path program 1 times [2019-10-15 01:23:51,267 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757648772] [2019-10-15 01:23:51,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:51,570 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:51,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757648772] [2019-10-15 01:23:51,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:51,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:51,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729970421] [2019-10-15 01:23:51,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:51,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:51,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:51,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:51,583 INFO L87 Difference]: Start difference. First operand 775 states and 1111 transitions. Second operand 4 states. [2019-10-15 01:23:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,684 INFO L93 Difference]: Finished difference Result 1532 states and 2197 transitions. [2019-10-15 01:23:51,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:51,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-15 01:23:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,693 INFO L225 Difference]: With dead ends: 1532 [2019-10-15 01:23:51,694 INFO L226 Difference]: Without dead ends: 775 [2019-10-15 01:23:51,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-15 01:23:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 774. [2019-10-15 01:23:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-15 01:23:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1108 transitions. [2019-10-15 01:23:51,777 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1108 transitions. Word has length 154 [2019-10-15 01:23:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:51,778 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1108 transitions. [2019-10-15 01:23:51,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1108 transitions. [2019-10-15 01:23:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:51,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,784 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1636071890, now seen corresponding path program 1 times [2019-10-15 01:23:51,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777544763] [2019-10-15 01:23:51,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,060 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:52,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777544763] [2019-10-15 01:23:52,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:52,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305087035] [2019-10-15 01:23:52,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:52,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:52,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:52,063 INFO L87 Difference]: Start difference. First operand 774 states and 1108 transitions. Second operand 4 states. [2019-10-15 01:23:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:52,143 INFO L93 Difference]: Finished difference Result 1535 states and 2199 transitions. [2019-10-15 01:23:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:52,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-15 01:23:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:52,149 INFO L225 Difference]: With dead ends: 1535 [2019-10-15 01:23:52,149 INFO L226 Difference]: Without dead ends: 772 [2019-10-15 01:23:52,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-10-15 01:23:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2019-10-15 01:23:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-10-15 01:23:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1104 transitions. [2019-10-15 01:23:52,192 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1104 transitions. Word has length 154 [2019-10-15 01:23:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,192 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1104 transitions. [2019-10-15 01:23:52,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1104 transitions. [2019-10-15 01:23:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:52,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,197 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash -674126987, now seen corresponding path program 1 times [2019-10-15 01:23:52,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965727156] [2019-10-15 01:23:52,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,353 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:52,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965727156] [2019-10-15 01:23:52,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:52,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232276543] [2019-10-15 01:23:52,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:52,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:52,356 INFO L87 Difference]: Start difference. First operand 772 states and 1104 transitions. Second operand 3 states. [2019-10-15 01:23:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:52,493 INFO L93 Difference]: Finished difference Result 1732 states and 2480 transitions. [2019-10-15 01:23:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:52,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-15 01:23:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:52,503 INFO L225 Difference]: With dead ends: 1732 [2019-10-15 01:23:52,504 INFO L226 Difference]: Without dead ends: 1156 [2019-10-15 01:23:52,506 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:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-10-15 01:23:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1130. [2019-10-15 01:23:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-15 01:23:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1602 transitions. [2019-10-15 01:23:52,639 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1602 transitions. Word has length 154 [2019-10-15 01:23:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,639 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1602 transitions. [2019-10-15 01:23:52,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1602 transitions. [2019-10-15 01:23:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:52,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,644 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1140766677, now seen corresponding path program 1 times [2019-10-15 01:23:52,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010471499] [2019-10-15 01:23:52,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,737 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:52,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010471499] [2019-10-15 01:23:52,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:52,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131201522] [2019-10-15 01:23:52,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:52,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:52,739 INFO L87 Difference]: Start difference. First operand 1130 states and 1602 transitions. Second operand 3 states. [2019-10-15 01:23:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:52,863 INFO L93 Difference]: Finished difference Result 2442 states and 3547 transitions. [2019-10-15 01:23:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:52,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-15 01:23:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:52,877 INFO L225 Difference]: With dead ends: 2442 [2019-10-15 01:23:52,877 INFO L226 Difference]: Without dead ends: 1501 [2019-10-15 01:23:52,880 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:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-10-15 01:23:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1342. [2019-10-15 01:23:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-15 01:23:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1945 transitions. [2019-10-15 01:23:52,966 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1945 transitions. Word has length 156 [2019-10-15 01:23:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,967 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1945 transitions. [2019-10-15 01:23:52,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1945 transitions. [2019-10-15 01:23:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:52,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,971 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1542236816, now seen corresponding path program 1 times [2019-10-15 01:23:52,972 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735161613] [2019-10-15 01:23:52,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,078 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:53,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735161613] [2019-10-15 01:23:53,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775738820] [2019-10-15 01:23:53,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,081 INFO L87 Difference]: Start difference. First operand 1342 states and 1945 transitions. Second operand 3 states. [2019-10-15 01:23:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,262 INFO L93 Difference]: Finished difference Result 2987 states and 4450 transitions. [2019-10-15 01:23:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-15 01:23:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,276 INFO L225 Difference]: With dead ends: 2987 [2019-10-15 01:23:53,277 INFO L226 Difference]: Without dead ends: 1918 [2019-10-15 01:23:53,281 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:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-10-15 01:23:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1719. [2019-10-15 01:23:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-10-15 01:23:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2553 transitions. [2019-10-15 01:23:53,481 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2553 transitions. Word has length 158 [2019-10-15 01:23:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,482 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2553 transitions. [2019-10-15 01:23:53,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2553 transitions. [2019-10-15 01:23:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:53,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,488 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1399172685, now seen corresponding path program 1 times [2019-10-15 01:23:53,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278792015] [2019-10-15 01:23:53,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,811 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:53,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278792015] [2019-10-15 01:23:53,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:53,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513847216] [2019-10-15 01:23:53,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:53,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:53,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:53,815 INFO L87 Difference]: Start difference. First operand 1719 states and 2553 transitions. Second operand 5 states. [2019-10-15 01:23:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:54,444 INFO L93 Difference]: Finished difference Result 4371 states and 6633 transitions. [2019-10-15 01:23:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:54,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-15 01:23:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:54,459 INFO L225 Difference]: With dead ends: 4371 [2019-10-15 01:23:54,459 INFO L226 Difference]: Without dead ends: 2835 [2019-10-15 01:23:54,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-10-15 01:23:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2833. [2019-10-15 01:23:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2019-10-15 01:23:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 4278 transitions. [2019-10-15 01:23:54,722 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 4278 transitions. Word has length 159 [2019-10-15 01:23:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:54,722 INFO L462 AbstractCegarLoop]: Abstraction has 2833 states and 4278 transitions. [2019-10-15 01:23:54,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 4278 transitions. [2019-10-15 01:23:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:23:54,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:54,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,727 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1519156504, now seen corresponding path program 1 times [2019-10-15 01:23:54,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:54,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252959819] [2019-10-15 01:23:54,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:54,961 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:54,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252959819] [2019-10-15 01:23:54,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:54,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:54,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425840547] [2019-10-15 01:23:54,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:54,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:54,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:54,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:54,963 INFO L87 Difference]: Start difference. First operand 2833 states and 4278 transitions. Second operand 4 states. [2019-10-15 01:23:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,351 INFO L93 Difference]: Finished difference Result 7338 states and 11090 transitions. [2019-10-15 01:23:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:55,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-15 01:23:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,377 INFO L225 Difference]: With dead ends: 7338 [2019-10-15 01:23:55,377 INFO L226 Difference]: Without dead ends: 4536 [2019-10-15 01:23:55,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-15 01:23:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4513. [2019-10-15 01:23:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4513 states. [2019-10-15 01:23:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6769 transitions. [2019-10-15 01:23:55,777 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6769 transitions. Word has length 159 [2019-10-15 01:23:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,777 INFO L462 AbstractCegarLoop]: Abstraction has 4513 states and 6769 transitions. [2019-10-15 01:23:55,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6769 transitions. [2019-10-15 01:23:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:23:55,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash 779025742, now seen corresponding path program 1 times [2019-10-15 01:23:55,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990022188] [2019-10-15 01:23:55,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,933 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:55,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990022188] [2019-10-15 01:23:55,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:55,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096596498] [2019-10-15 01:23:55,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:55,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:55,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:55,936 INFO L87 Difference]: Start difference. First operand 4513 states and 6769 transitions. Second operand 3 states. [2019-10-15 01:23:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,480 INFO L93 Difference]: Finished difference Result 11128 states and 16749 transitions. [2019-10-15 01:23:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:56,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-15 01:23:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,513 INFO L225 Difference]: With dead ends: 11128 [2019-10-15 01:23:56,514 INFO L226 Difference]: Without dead ends: 6987 [2019-10-15 01:23:56,528 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:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2019-10-15 01:23:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6966. [2019-10-15 01:23:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-10-15 01:23:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 10335 transitions. [2019-10-15 01:23:56,957 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 10335 transitions. Word has length 161 [2019-10-15 01:23:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,958 INFO L462 AbstractCegarLoop]: Abstraction has 6966 states and 10335 transitions. [2019-10-15 01:23:56,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 10335 transitions. [2019-10-15 01:23:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 01:23:56,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:56,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -169339511, now seen corresponding path program 1 times [2019-10-15 01:23:56,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:56,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615943289] [2019-10-15 01:23:56,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,059 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:57,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615943289] [2019-10-15 01:23:57,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:57,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49497354] [2019-10-15 01:23:57,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:57,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,062 INFO L87 Difference]: Start difference. First operand 6966 states and 10335 transitions. Second operand 3 states. [2019-10-15 01:23:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,699 INFO L93 Difference]: Finished difference Result 17929 states and 27059 transitions. [2019-10-15 01:23:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:57,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-15 01:23:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,741 INFO L225 Difference]: With dead ends: 17929 [2019-10-15 01:23:57,741 INFO L226 Difference]: Without dead ends: 11304 [2019-10-15 01:23:57,756 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:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2019-10-15 01:23:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 10364. [2019-10-15 01:23:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10364 states. [2019-10-15 01:23:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10364 states to 10364 states and 15734 transitions. [2019-10-15 01:23:58,561 INFO L78 Accepts]: Start accepts. Automaton has 10364 states and 15734 transitions. Word has length 165 [2019-10-15 01:23:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:58,562 INFO L462 AbstractCegarLoop]: Abstraction has 10364 states and 15734 transitions. [2019-10-15 01:23:58,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 10364 states and 15734 transitions. [2019-10-15 01:23:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:58,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:58,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,570 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:58,571 INFO L82 PathProgramCache]: Analyzing trace with hash 628802590, now seen corresponding path program 1 times [2019-10-15 01:23:58,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:58,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491510738] [2019-10-15 01:23:58,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:58,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,813 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:58,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491510738] [2019-10-15 01:23:58,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:58,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:58,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718370409] [2019-10-15 01:23:58,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:58,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:58,816 INFO L87 Difference]: Start difference. First operand 10364 states and 15734 transitions. Second operand 8 states. [2019-10-15 01:24:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:01,597 INFO L93 Difference]: Finished difference Result 41170 states and 63107 transitions. [2019-10-15 01:24:01,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:24:01,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-10-15 01:24:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:01,706 INFO L225 Difference]: With dead ends: 41170 [2019-10-15 01:24:01,706 INFO L226 Difference]: Without dead ends: 31221 [2019-10-15 01:24:01,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:24:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31221 states. [2019-10-15 01:24:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31221 to 16912. [2019-10-15 01:24:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16912 states. [2019-10-15 01:24:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16912 states to 16912 states and 25456 transitions. [2019-10-15 01:24:03,695 INFO L78 Accepts]: Start accepts. Automaton has 16912 states and 25456 transitions. Word has length 166 [2019-10-15 01:24:03,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:03,695 INFO L462 AbstractCegarLoop]: Abstraction has 16912 states and 25456 transitions. [2019-10-15 01:24:03,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:24:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16912 states and 25456 transitions. [2019-10-15 01:24:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:24:03,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:03,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:03,709 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash -961444745, now seen corresponding path program 1 times [2019-10-15 01:24:03,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:03,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654714353] [2019-10-15 01:24:03,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:03,959 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:24:03,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654714353] [2019-10-15 01:24:03,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:03,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:03,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631193133] [2019-10-15 01:24:03,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:03,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:03,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:03,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:03,962 INFO L87 Difference]: Start difference. First operand 16912 states and 25456 transitions. Second operand 4 states. [2019-10-15 01:24:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,404 INFO L93 Difference]: Finished difference Result 47014 states and 70541 transitions. [2019-10-15 01:24:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:05,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-15 01:24:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,513 INFO L225 Difference]: With dead ends: 47014 [2019-10-15 01:24:05,513 INFO L226 Difference]: Without dead ends: 30145 [2019-10-15 01:24:05,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30145 states. [2019-10-15 01:24:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30145 to 30107. [2019-10-15 01:24:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30107 states. [2019-10-15 01:24:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30107 states to 30107 states and 44602 transitions. [2019-10-15 01:24:07,133 INFO L78 Accepts]: Start accepts. Automaton has 30107 states and 44602 transitions. Word has length 166 [2019-10-15 01:24:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:07,133 INFO L462 AbstractCegarLoop]: Abstraction has 30107 states and 44602 transitions. [2019-10-15 01:24:07,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30107 states and 44602 transitions. [2019-10-15 01:24:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:24:07,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:07,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:07,149 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash 155010953, now seen corresponding path program 1 times [2019-10-15 01:24:07,150 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:07,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085380065] [2019-10-15 01:24:07,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:07,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:07,219 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:24:07,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085380065] [2019-10-15 01:24:07,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:07,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:07,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145331365] [2019-10-15 01:24:07,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:07,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:07,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:07,221 INFO L87 Difference]: Start difference. First operand 30107 states and 44602 transitions. Second operand 3 states. [2019-10-15 01:24:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:10,204 INFO L93 Difference]: Finished difference Result 90119 states and 133549 transitions. [2019-10-15 01:24:10,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:10,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-15 01:24:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:10,359 INFO L225 Difference]: With dead ends: 90119 [2019-10-15 01:24:10,359 INFO L226 Difference]: Without dead ends: 60122 [2019-10-15 01:24:10,425 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:24:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60122 states. [2019-10-15 01:24:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60122 to 30113. [2019-10-15 01:24:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30113 states. [2019-10-15 01:24:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30113 states to 30113 states and 44608 transitions. [2019-10-15 01:24:12,239 INFO L78 Accepts]: Start accepts. Automaton has 30113 states and 44608 transitions. Word has length 167 [2019-10-15 01:24:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:12,240 INFO L462 AbstractCegarLoop]: Abstraction has 30113 states and 44608 transitions. [2019-10-15 01:24:12,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30113 states and 44608 transitions. [2019-10-15 01:24:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 01:24:12,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:12,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:12,255 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:12,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:12,255 INFO L82 PathProgramCache]: Analyzing trace with hash -899511549, now seen corresponding path program 1 times [2019-10-15 01:24:12,255 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:12,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273999973] [2019-10-15 01:24:12,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:12,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:12,391 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:24:12,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273999973] [2019-10-15 01:24:12,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:12,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:12,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938599332] [2019-10-15 01:24:12,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:12,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:12,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:12,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:12,394 INFO L87 Difference]: Start difference. First operand 30113 states and 44608 transitions. Second operand 3 states. [2019-10-15 01:24:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:15,586 INFO L93 Difference]: Finished difference Result 79104 states and 117010 transitions. [2019-10-15 01:24:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:15,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-15 01:24:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:15,664 INFO L225 Difference]: With dead ends: 79104 [2019-10-15 01:24:15,664 INFO L226 Difference]: Without dead ends: 49750 [2019-10-15 01:24:15,710 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:24:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49750 states. [2019-10-15 01:24:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49750 to 49712. [2019-10-15 01:24:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49712 states. [2019-10-15 01:24:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49712 states to 49712 states and 72594 transitions. [2019-10-15 01:24:18,314 INFO L78 Accepts]: Start accepts. Automaton has 49712 states and 72594 transitions. Word has length 168 [2019-10-15 01:24:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:18,314 INFO L462 AbstractCegarLoop]: Abstraction has 49712 states and 72594 transitions. [2019-10-15 01:24:18,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 49712 states and 72594 transitions. [2019-10-15 01:24:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 01:24:18,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:18,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:18,334 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:18,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1575562976, now seen corresponding path program 1 times [2019-10-15 01:24:18,335 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:18,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624190015] [2019-10-15 01:24:18,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:18,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:18,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:18,492 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:24:18,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624190015] [2019-10-15 01:24:18,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:18,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:18,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413793082] [2019-10-15 01:24:18,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:18,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:18,495 INFO L87 Difference]: Start difference. First operand 49712 states and 72594 transitions. Second operand 4 states.