/usr/bin/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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:04:47,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:04:47,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:04:47,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:04:47,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:04:47,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:04:47,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:04:47,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:04:47,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:04:47,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:04:47,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:04:47,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:04:47,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:04:47,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:04:47,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:04:47,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:04:47,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:04:47,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:04:47,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:04:47,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:04:47,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:04:47,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:04:47,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:04:47,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:04:47,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:04:47,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:04:47,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:04:47,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:04:47,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:04:47,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:04:47,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:04:47,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:04:47,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:04:47,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:04:47,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:04:47,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:04:47,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:04:47,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:04:47,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:04:47,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:04:47,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:04:47,083 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-11-07 01:04:47,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:04:47,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:04:47,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:04:47,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:04:47,099 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:04:47,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:04:47,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:04:47,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:04:47,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:04:47,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:04:47,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:04:47,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:04:47,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:04:47,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:04:47,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:04:47,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:04:47,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:04:47,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:04:47,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:04:47,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:04:47,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:04:47,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:04:47,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:04:47,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:04:47,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:04:47,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:04:47,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:04:47,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:04:47,104 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-11-07 01:04:47,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:04:47,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:04:47,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:04:47,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:04:47,455 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:04:47,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:04:47,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e580ce2/e9fe37ab3143480f963d9540b5abbf50/FLAG2dbe2c516 [2019-11-07 01:04:48,154 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:04:48,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:04:48,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e580ce2/e9fe37ab3143480f963d9540b5abbf50/FLAG2dbe2c516 [2019-11-07 01:04:48,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e580ce2/e9fe37ab3143480f963d9540b5abbf50 [2019-11-07 01:04:48,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:04:48,440 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:04:48,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:48,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:04:48,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:04:48,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:48" (1/1) ... [2019-11-07 01:04:48,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f36264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:48, skipping insertion in model container [2019-11-07 01:04:48,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:48" (1/1) ... [2019-11-07 01:04:48,455 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:04:48,542 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:04:49,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:49,125 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:04:49,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:49,628 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:04:49,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49 WrapperNode [2019-11-07 01:04:49,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:49,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:04:49,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:04:49,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:04:49,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:04:49,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:04:49,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:04:49,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:04:49,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (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-11-07 01:04:49,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:04:49,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:04:49,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:04:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:04:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:04:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:04:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:04:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:04:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:04:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:04:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:04:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:04:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:04:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:04:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:04:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:04:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:04:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:04:51,504 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:04:51,505 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:04:51,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:51 BoogieIcfgContainer [2019-11-07 01:04:51,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:04:51,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:04:51,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:04:51,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:04:51,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:48" (1/3) ... [2019-11-07 01:04:51,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f680431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:51, skipping insertion in model container [2019-11-07 01:04:51,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49" (2/3) ... [2019-11-07 01:04:51,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f680431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:51, skipping insertion in model container [2019-11-07 01:04:51,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:51" (3/3) ... [2019-11-07 01:04:51,526 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:04:51,540 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:04:51,566 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:04:51,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:04:51,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:04:51,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:04:51,629 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:04:51,630 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:04:51,630 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:04:51,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:04:51,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:04:51,630 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:04:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-11-07 01:04:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 01:04:51,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:51,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:51,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1111774015, now seen corresponding path program 1 times [2019-11-07 01:04:51,722 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:51,723 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730783318] [2019-11-07 01:04:51,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:52,684 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730783318] [2019-11-07 01:04:52,685 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:52,685 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:52,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839494293] [2019-11-07 01:04:52,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:52,694 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:52,712 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 4 states. [2019-11-07 01:04:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:53,000 INFO L93 Difference]: Finished difference Result 1107 states and 1990 transitions. [2019-11-07 01:04:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:04:53,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-07 01:04:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:53,028 INFO L225 Difference]: With dead ends: 1107 [2019-11-07 01:04:53,028 INFO L226 Difference]: Without dead ends: 730 [2019-11-07 01:04:53,035 INFO L630 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-11-07 01:04:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-07 01:04:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 705. [2019-11-07 01:04:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-07 01:04:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1008 transitions. [2019-11-07 01:04:53,197 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1008 transitions. Word has length 143 [2019-11-07 01:04:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:53,197 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1008 transitions. [2019-11-07 01:04:53,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1008 transitions. [2019-11-07 01:04:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-07 01:04:53,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:53,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:53,208 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:53,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash 25365273, now seen corresponding path program 1 times [2019-11-07 01:04:53,209 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:53,209 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267344263] [2019-11-07 01:04:53,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:53,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267344263] [2019-11-07 01:04:53,430 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:53,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:53,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042002053] [2019-11-07 01:04:53,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:53,433 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:53,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:53,434 INFO L87 Difference]: Start difference. First operand 705 states and 1008 transitions. Second operand 3 states. [2019-11-07 01:04:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:53,505 INFO L93 Difference]: Finished difference Result 2069 states and 2954 transitions. [2019-11-07 01:04:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:53,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-07 01:04:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:53,513 INFO L225 Difference]: With dead ends: 2069 [2019-11-07 01:04:53,514 INFO L226 Difference]: Without dead ends: 1396 [2019-11-07 01:04:53,520 INFO L630 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-11-07 01:04:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-11-07 01:04:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 707. [2019-11-07 01:04:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-11-07 01:04:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1010 transitions. [2019-11-07 01:04:53,580 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1010 transitions. Word has length 144 [2019-11-07 01:04:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:53,582 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1010 transitions. [2019-11-07 01:04:53,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1010 transitions. [2019-11-07 01:04:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 01:04:53,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:53,585 INFO L410 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] [2019-11-07 01:04:53,585 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash 166703234, now seen corresponding path program 1 times [2019-11-07 01:04:53,586 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:53,587 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095883375] [2019-11-07 01:04:53,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:53,741 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095883375] [2019-11-07 01:04:53,741 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:53,742 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:53,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368806601] [2019-11-07 01:04:53,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:53,743 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:53,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:53,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:53,744 INFO L87 Difference]: Start difference. First operand 707 states and 1010 transitions. Second operand 3 states. [2019-11-07 01:04:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:53,875 INFO L93 Difference]: Finished difference Result 1893 states and 2715 transitions. [2019-11-07 01:04:53,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:53,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-07 01:04:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:53,886 INFO L225 Difference]: With dead ends: 1893 [2019-11-07 01:04:53,887 INFO L226 Difference]: Without dead ends: 1368 [2019-11-07 01:04:53,898 INFO L630 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-11-07 01:04:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-11-07 01:04:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1343. [2019-11-07 01:04:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-07 01:04:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1911 transitions. [2019-11-07 01:04:54,019 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1911 transitions. Word has length 145 [2019-11-07 01:04:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:54,020 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1911 transitions. [2019-11-07 01:04:54,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1911 transitions. [2019-11-07 01:04:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 01:04:54,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:54,024 INFO L410 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] [2019-11-07 01:04:54,025 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash 271175045, now seen corresponding path program 1 times [2019-11-07 01:04:54,025 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:54,026 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745949285] [2019-11-07 01:04:54,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:54,262 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745949285] [2019-11-07 01:04:54,263 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:54,263 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:54,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81095283] [2019-11-07 01:04:54,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:54,264 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:54,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:54,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:54,264 INFO L87 Difference]: Start difference. First operand 1343 states and 1911 transitions. Second operand 4 states. [2019-11-07 01:04:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:54,355 INFO L93 Difference]: Finished difference Result 2201 states and 3141 transitions. [2019-11-07 01:04:54,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:54,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-07 01:04:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:54,363 INFO L225 Difference]: With dead ends: 2201 [2019-11-07 01:04:54,363 INFO L226 Difference]: Without dead ends: 1030 [2019-11-07 01:04:54,366 INFO L630 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-11-07 01:04:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-11-07 01:04:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2019-11-07 01:04:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2019-11-07 01:04:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1457 transitions. [2019-11-07 01:04:54,419 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1457 transitions. Word has length 145 [2019-11-07 01:04:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:54,420 INFO L462 AbstractCegarLoop]: Abstraction has 1030 states and 1457 transitions. [2019-11-07 01:04:54,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1457 transitions. [2019-11-07 01:04:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:04:54,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:54,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:54,423 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1646821595, now seen corresponding path program 1 times [2019-11-07 01:04:54,424 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:54,424 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202356884] [2019-11-07 01:04:54,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:54,784 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202356884] [2019-11-07 01:04:54,785 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:54,785 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:04:54,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65228265] [2019-11-07 01:04:54,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:04:54,786 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:04:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:04:54,787 INFO L87 Difference]: Start difference. First operand 1030 states and 1457 transitions. Second operand 9 states. [2019-11-07 01:04:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:55,717 INFO L93 Difference]: Finished difference Result 2677 states and 3904 transitions. [2019-11-07 01:04:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:04:55,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-11-07 01:04:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:55,728 INFO L225 Difference]: With dead ends: 2677 [2019-11-07 01:04:55,728 INFO L226 Difference]: Without dead ends: 1818 [2019-11-07 01:04:55,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:04:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-11-07 01:04:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1496. [2019-11-07 01:04:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-07 01:04:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2138 transitions. [2019-11-07 01:04:55,853 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2138 transitions. Word has length 151 [2019-11-07 01:04:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:55,854 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2138 transitions. [2019-11-07 01:04:55,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:04:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2138 transitions. [2019-11-07 01:04:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:04:55,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:55,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:55,859 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash 154501339, now seen corresponding path program 1 times [2019-11-07 01:04:55,859 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:55,859 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736133881] [2019-11-07 01:04:55,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:56,041 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736133881] [2019-11-07 01:04:56,042 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:56,042 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:56,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844144557] [2019-11-07 01:04:56,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:56,043 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:56,044 INFO L87 Difference]: Start difference. First operand 1496 states and 2138 transitions. Second operand 4 states. [2019-11-07 01:04:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:56,291 INFO L93 Difference]: Finished difference Result 2950 states and 4367 transitions. [2019-11-07 01:04:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:56,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-07 01:04:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:56,303 INFO L225 Difference]: With dead ends: 2950 [2019-11-07 01:04:56,303 INFO L226 Difference]: Without dead ends: 2430 [2019-11-07 01:04:56,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2019-11-07 01:04:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2428. [2019-11-07 01:04:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-11-07 01:04:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3512 transitions. [2019-11-07 01:04:56,466 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3512 transitions. Word has length 151 [2019-11-07 01:04:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:56,467 INFO L462 AbstractCegarLoop]: Abstraction has 2428 states and 3512 transitions. [2019-11-07 01:04:56,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3512 transitions. [2019-11-07 01:04:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:04:56,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:56,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:56,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:56,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2031358202, now seen corresponding path program 1 times [2019-11-07 01:04:56,475 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:56,476 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512430700] [2019-11-07 01:04:56,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:56,814 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512430700] [2019-11-07 01:04:56,815 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:56,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:56,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320531085] [2019-11-07 01:04:56,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:56,816 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:56,817 INFO L87 Difference]: Start difference. First operand 2428 states and 3512 transitions. Second operand 4 states. [2019-11-07 01:04:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:57,197 INFO L93 Difference]: Finished difference Result 6277 states and 9070 transitions. [2019-11-07 01:04:57,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:57,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-07 01:04:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:57,217 INFO L225 Difference]: With dead ends: 6277 [2019-11-07 01:04:57,217 INFO L226 Difference]: Without dead ends: 3872 [2019-11-07 01:04:57,223 INFO L630 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-11-07 01:04:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2019-11-07 01:04:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3850. [2019-11-07 01:04:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3850 states. [2019-11-07 01:04:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 5507 transitions. [2019-11-07 01:04:57,525 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 5507 transitions. Word has length 151 [2019-11-07 01:04:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:57,525 INFO L462 AbstractCegarLoop]: Abstraction has 3850 states and 5507 transitions. [2019-11-07 01:04:57,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 5507 transitions. [2019-11-07 01:04:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:04:57,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:57,534 INFO L410 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-11-07 01:04:57,534 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash 30760331, now seen corresponding path program 1 times [2019-11-07 01:04:57,535 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:57,535 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593252503] [2019-11-07 01:04:57,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:57,627 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593252503] [2019-11-07 01:04:57,627 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:57,628 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:57,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420476603] [2019-11-07 01:04:57,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:57,629 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:57,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:57,629 INFO L87 Difference]: Start difference. First operand 3850 states and 5507 transitions. Second operand 3 states. [2019-11-07 01:04:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:58,075 INFO L93 Difference]: Finished difference Result 10830 states and 15529 transitions. [2019-11-07 01:04:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:58,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-07 01:04:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:58,113 INFO L225 Difference]: With dead ends: 10830 [2019-11-07 01:04:58,113 INFO L226 Difference]: Without dead ends: 7331 [2019-11-07 01:04:58,192 INFO L630 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-11-07 01:04:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-11-07 01:04:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7311. [2019-11-07 01:04:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7311 states. [2019-11-07 01:04:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7311 states to 7311 states and 10356 transitions. [2019-11-07 01:04:58,654 INFO L78 Accepts]: Start accepts. Automaton has 7311 states and 10356 transitions. Word has length 153 [2019-11-07 01:04:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:58,654 INFO L462 AbstractCegarLoop]: Abstraction has 7311 states and 10356 transitions. [2019-11-07 01:04:58,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7311 states and 10356 transitions. [2019-11-07 01:04:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:04:58,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:58,666 INFO L410 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-11-07 01:04:58,666 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:58,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1476891570, now seen corresponding path program 1 times [2019-11-07 01:04:58,667 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:58,667 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130671491] [2019-11-07 01:04:58,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:58,807 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130671491] [2019-11-07 01:04:58,807 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:58,808 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:58,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70047777] [2019-11-07 01:04:58,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:58,809 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:58,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:58,809 INFO L87 Difference]: Start difference. First operand 7311 states and 10356 transitions. Second operand 4 states. [2019-11-07 01:04:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:59,199 INFO L93 Difference]: Finished difference Result 11608 states and 16445 transitions. [2019-11-07 01:04:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:59,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-07 01:04:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:59,250 INFO L225 Difference]: With dead ends: 11608 [2019-11-07 01:04:59,250 INFO L226 Difference]: Without dead ends: 5961 [2019-11-07 01:04:59,263 INFO L630 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-11-07 01:04:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2019-11-07 01:04:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5961. [2019-11-07 01:04:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5961 states. [2019-11-07 01:04:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 8411 transitions. [2019-11-07 01:04:59,623 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 8411 transitions. Word has length 153 [2019-11-07 01:04:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:59,623 INFO L462 AbstractCegarLoop]: Abstraction has 5961 states and 8411 transitions. [2019-11-07 01:04:59,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 8411 transitions. [2019-11-07 01:04:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:04:59,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:59,633 INFO L410 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-11-07 01:04:59,634 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 770800706, now seen corresponding path program 1 times [2019-11-07 01:04:59,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:59,635 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592359156] [2019-11-07 01:04:59,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:59,951 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592359156] [2019-11-07 01:04:59,951 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:59,952 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:04:59,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718614685] [2019-11-07 01:04:59,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:04:59,953 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:04:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:04:59,954 INFO L87 Difference]: Start difference. First operand 5961 states and 8411 transitions. Second operand 8 states. [2019-11-07 01:05:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:01,668 INFO L93 Difference]: Finished difference Result 20223 states and 30063 transitions. [2019-11-07 01:05:01,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:05:01,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-07 01:05:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:01,707 INFO L225 Difference]: With dead ends: 20223 [2019-11-07 01:05:01,707 INFO L226 Difference]: Without dead ends: 17597 [2019-11-07 01:05:01,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-07 01:05:01,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17597 states. [2019-11-07 01:05:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17597 to 16970. [2019-11-07 01:05:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16970 states. [2019-11-07 01:05:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16970 states to 16970 states and 24854 transitions. [2019-11-07 01:05:02,850 INFO L78 Accepts]: Start accepts. Automaton has 16970 states and 24854 transitions. Word has length 159 [2019-11-07 01:05:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:02,851 INFO L462 AbstractCegarLoop]: Abstraction has 16970 states and 24854 transitions. [2019-11-07 01:05:02,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:05:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 16970 states and 24854 transitions. [2019-11-07 01:05:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:05:02,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:02,868 INFO L410 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-11-07 01:05:02,869 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1027311707, now seen corresponding path program 1 times [2019-11-07 01:05:02,869 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:02,870 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824630138] [2019-11-07 01:05:02,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:03,074 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824630138] [2019-11-07 01:05:03,075 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:03,075 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:03,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058731456] [2019-11-07 01:05:03,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:03,076 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:03,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:03,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:03,076 INFO L87 Difference]: Start difference. First operand 16970 states and 24854 transitions. Second operand 4 states. [2019-11-07 01:05:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:04,650 INFO L93 Difference]: Finished difference Result 49667 states and 72598 transitions. [2019-11-07 01:05:04,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:04,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-07 01:05:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:04,727 INFO L225 Difference]: With dead ends: 49667 [2019-11-07 01:05:04,727 INFO L226 Difference]: Without dead ends: 32740 [2019-11-07 01:05:04,761 INFO L630 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-11-07 01:05:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32740 states. [2019-11-07 01:05:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32740 to 32684. [2019-11-07 01:05:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-11-07 01:05:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47291 transitions. [2019-11-07 01:05:06,956 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47291 transitions. Word has length 159 [2019-11-07 01:05:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:06,956 INFO L462 AbstractCegarLoop]: Abstraction has 32684 states and 47291 transitions. [2019-11-07 01:05:06,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47291 transitions. [2019-11-07 01:05:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-07 01:05:07,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:07,001 INFO L410 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] [2019-11-07 01:05:07,001 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1202093437, now seen corresponding path program 1 times [2019-11-07 01:05:07,002 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:07,002 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509606713] [2019-11-07 01:05:07,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:07,061 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509606713] [2019-11-07 01:05:07,061 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:07,062 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:07,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124444748] [2019-11-07 01:05:07,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:07,063 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:07,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:07,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:07,063 INFO L87 Difference]: Start difference. First operand 32684 states and 47291 transitions. Second operand 3 states. [2019-11-07 01:05:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:10,222 INFO L93 Difference]: Finished difference Result 97858 states and 141624 transitions. [2019-11-07 01:05:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:10,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-07 01:05:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:10,366 INFO L225 Difference]: With dead ends: 97858 [2019-11-07 01:05:10,366 INFO L226 Difference]: Without dead ends: 65280 [2019-11-07 01:05:10,422 INFO L630 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-11-07 01:05:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65280 states. [2019-11-07 01:05:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65280 to 32690. [2019-11-07 01:05:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-11-07 01:05:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 47297 transitions. [2019-11-07 01:05:12,245 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 47297 transitions. Word has length 160 [2019-11-07 01:05:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:12,245 INFO L462 AbstractCegarLoop]: Abstraction has 32690 states and 47297 transitions. [2019-11-07 01:05:12,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 47297 transitions. [2019-11-07 01:05:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:05:12,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:12,269 INFO L410 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-11-07 01:05:12,269 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1346353852, now seen corresponding path program 1 times [2019-11-07 01:05:12,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:12,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126756814] [2019-11-07 01:05:12,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:12,418 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126756814] [2019-11-07 01:05:12,421 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:12,421 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:12,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445136661] [2019-11-07 01:05:12,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:12,422 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:12,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:12,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:12,422 INFO L87 Difference]: Start difference. First operand 32690 states and 47297 transitions. Second operand 4 states. [2019-11-07 01:05:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:13,852 INFO L93 Difference]: Finished difference Result 65338 states and 94538 transitions. [2019-11-07 01:05:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:13,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-07 01:05:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:13,899 INFO L225 Difference]: With dead ends: 65338 [2019-11-07 01:05:13,899 INFO L226 Difference]: Without dead ends: 32684 [2019-11-07 01:05:13,935 INFO L630 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-11-07 01:05:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32684 states. [2019-11-07 01:05:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32684 to 32684. [2019-11-07 01:05:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-11-07 01:05:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47285 transitions. [2019-11-07 01:05:16,464 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47285 transitions. Word has length 161 [2019-11-07 01:05:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:16,464 INFO L462 AbstractCegarLoop]: Abstraction has 32684 states and 47285 transitions. [2019-11-07 01:05:16,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47285 transitions. [2019-11-07 01:05:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:05:16,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:16,481 INFO L410 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-11-07 01:05:16,481 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash 913057412, now seen corresponding path program 1 times [2019-11-07 01:05:16,482 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:16,482 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103458746] [2019-11-07 01:05:16,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:16,573 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103458746] [2019-11-07 01:05:16,574 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:16,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:16,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561727788] [2019-11-07 01:05:16,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:16,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:16,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:16,575 INFO L87 Difference]: Start difference. First operand 32684 states and 47285 transitions. Second operand 3 states. [2019-11-07 01:05:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:18,719 INFO L93 Difference]: Finished difference Result 80670 states and 116554 transitions. [2019-11-07 01:05:18,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:18,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-07 01:05:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:18,778 INFO L225 Difference]: With dead ends: 80670 [2019-11-07 01:05:18,778 INFO L226 Difference]: Without dead ends: 48670 [2019-11-07 01:05:18,813 INFO L630 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-11-07 01:05:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48670 states.