/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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:36,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:36,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:36,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:36,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:36,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:36,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:36,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:36,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:36,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:36,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:36,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:36,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:36,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:36,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:36,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:36,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:36,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:36,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:36,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:36,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:36,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:36,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:36,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:36,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:36,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:36,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:36,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:36,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:36,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:36,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:36,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:36,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:36,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:36,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:36,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:36,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:36,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:36,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:36,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:36,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:36,466 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:06:36,499 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:36,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:36,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:36,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:36,504 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:36,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:36,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:36,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:36,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:36,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:36,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:36,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:36,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:36,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:36,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:36,507 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:36,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:36,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:36,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:36,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:36,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:36,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:36,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:36,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:36,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:36,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:36,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:36,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:36,510 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:06:36,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:36,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:36,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:36,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:36,818 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:36,818 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+nlh-reducer.c [2019-11-07 01:06:36,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88898913/bf5fda6d060a4f9e8dd63ea77147d3fb/FLAG2d61a18b0 [2019-11-07 01:06:37,408 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:37,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:37,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88898913/bf5fda6d060a4f9e8dd63ea77147d3fb/FLAG2d61a18b0 [2019-11-07 01:06:37,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f88898913/bf5fda6d060a4f9e8dd63ea77147d3fb [2019-11-07 01:06:37,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:37,668 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:37,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:37,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:37,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:37,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:37" (1/1) ... [2019-11-07 01:06:37,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8571ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:37, skipping insertion in model container [2019-11-07 01:06:37,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:37" (1/1) ... [2019-11-07 01:06:37,688 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:37,754 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:38,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:38,385 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:38,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:38,576 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:38,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38 WrapperNode [2019-11-07 01:06:38,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:38,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:38,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:38,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:38,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (1/1) ... [2019-11-07 01:06:38,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (1/1) ... [2019-11-07 01:06:38,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (1/1) ... [2019-11-07 01:06:38,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (1/1) ... [2019-11-07 01:06:38,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (1/1) ... [2019-11-07 01:06:38,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (1/1) ... [2019-11-07 01:06:38,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (1/1) ... [2019-11-07 01:06:38,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:38,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:38,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:38,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:38,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (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:06:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:38,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:40,335 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:40,335 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:40,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:40 BoogieIcfgContainer [2019-11-07 01:06:40,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:40,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:40,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:40,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:40,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:37" (1/3) ... [2019-11-07 01:06:40,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208be302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:40, skipping insertion in model container [2019-11-07 01:06:40,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:38" (2/3) ... [2019-11-07 01:06:40,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208be302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:40, skipping insertion in model container [2019-11-07 01:06:40,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:40" (3/3) ... [2019-11-07 01:06:40,346 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:40,357 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:40,367 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:06:40,380 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:06:40,411 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:40,412 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:40,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:40,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:40,412 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:40,412 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:40,412 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:40,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2019-11-07 01:06:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:06:40,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:40,460 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] [2019-11-07 01:06:40,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 424996304, now seen corresponding path program 1 times [2019-11-07 01:06:40,482 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:40,483 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694338561] [2019-11-07 01:06:40,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:41,227 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:06:41,228 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694338561] [2019-11-07 01:06:41,229 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:41,229 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:41,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28605463] [2019-11-07 01:06:41,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:41,237 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:41,254 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2019-11-07 01:06:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:41,485 INFO L93 Difference]: Finished difference Result 655 states and 1134 transitions. [2019-11-07 01:06:41,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:41,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-07 01:06:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:41,519 INFO L225 Difference]: With dead ends: 655 [2019-11-07 01:06:41,520 INFO L226 Difference]: Without dead ends: 540 [2019-11-07 01:06:41,526 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:06:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-07 01:06:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-11-07 01:06:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-07 01:06:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2019-11-07 01:06:41,619 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 157 [2019-11-07 01:06:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:41,622 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2019-11-07 01:06:41,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2019-11-07 01:06:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:06:41,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:41,635 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] [2019-11-07 01:06:41,635 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1469457116, now seen corresponding path program 1 times [2019-11-07 01:06:41,639 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:41,639 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257886138] [2019-11-07 01:06:41,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:42,107 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:06:42,108 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257886138] [2019-11-07 01:06:42,108 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:42,108 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:42,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26781380] [2019-11-07 01:06:42,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:42,112 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:42,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:42,112 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand 4 states. [2019-11-07 01:06:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:42,286 INFO L93 Difference]: Finished difference Result 1561 states and 2326 transitions. [2019-11-07 01:06:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:42,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-07 01:06:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:42,295 INFO L225 Difference]: With dead ends: 1561 [2019-11-07 01:06:42,295 INFO L226 Difference]: Without dead ends: 1036 [2019-11-07 01:06:42,303 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:06:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-11-07 01:06:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2019-11-07 01:06:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-07 01:06:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2019-11-07 01:06:42,395 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 157 [2019-11-07 01:06:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:42,397 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2019-11-07 01:06:42,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2019-11-07 01:06:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:06:42,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:42,409 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] [2019-11-07 01:06:42,410 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash -790671312, now seen corresponding path program 1 times [2019-11-07 01:06:42,411 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:42,412 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329604050] [2019-11-07 01:06:42,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:42,525 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:06:42,525 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329604050] [2019-11-07 01:06:42,525 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:42,526 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:42,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729606398] [2019-11-07 01:06:42,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:42,528 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:42,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:42,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:42,529 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand 3 states. [2019-11-07 01:06:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:42,650 INFO L93 Difference]: Finished difference Result 3056 states and 4517 transitions. [2019-11-07 01:06:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:42,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-07 01:06:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:42,667 INFO L225 Difference]: With dead ends: 3056 [2019-11-07 01:06:42,668 INFO L226 Difference]: Without dead ends: 2054 [2019-11-07 01:06:42,682 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:06:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-11-07 01:06:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1036. [2019-11-07 01:06:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-11-07 01:06:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1531 transitions. [2019-11-07 01:06:42,815 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1531 transitions. Word has length 158 [2019-11-07 01:06:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:42,815 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1531 transitions. [2019-11-07 01:06:42,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1531 transitions. [2019-11-07 01:06:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:06:42,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:42,822 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:06:42,822 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:42,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:42,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1966932605, now seen corresponding path program 1 times [2019-11-07 01:06:42,823 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:42,824 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534117637] [2019-11-07 01:06:42,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,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:06:43,062 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534117637] [2019-11-07 01:06:43,062 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,062 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:43,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978959079] [2019-11-07 01:06:43,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:43,063 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:43,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:43,064 INFO L87 Difference]: Start difference. First operand 1036 states and 1531 transitions. Second operand 4 states. [2019-11-07 01:06:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:43,139 INFO L93 Difference]: Finished difference Result 2054 states and 3037 transitions. [2019-11-07 01:06:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:43,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-07 01:06:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:43,146 INFO L225 Difference]: With dead ends: 2054 [2019-11-07 01:06:43,146 INFO L226 Difference]: Without dead ends: 1036 [2019-11-07 01:06:43,148 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:06:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-11-07 01:06:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1035. [2019-11-07 01:06:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-11-07 01:06:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1528 transitions. [2019-11-07 01:06:43,201 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1528 transitions. Word has length 159 [2019-11-07 01:06:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:43,202 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1528 transitions. [2019-11-07 01:06:43,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1528 transitions. [2019-11-07 01:06:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:06:43,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:43,205 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:06:43,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:43,206 INFO L82 PathProgramCache]: Analyzing trace with hash 745680526, now seen corresponding path program 1 times [2019-11-07 01:06:43,206 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:43,207 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404450095] [2019-11-07 01:06:43,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,356 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:06:43,356 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404450095] [2019-11-07 01:06:43,357 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,357 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:43,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428325555] [2019-11-07 01:06:43,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:43,358 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:43,358 INFO L87 Difference]: Start difference. First operand 1035 states and 1528 transitions. Second operand 3 states. [2019-11-07 01:06:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:43,492 INFO L93 Difference]: Finished difference Result 2834 states and 4197 transitions. [2019-11-07 01:06:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:43,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-07 01:06:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:43,503 INFO L225 Difference]: With dead ends: 2834 [2019-11-07 01:06:43,503 INFO L226 Difference]: Without dead ends: 1997 [2019-11-07 01:06:43,506 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:06:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-11-07 01:06:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2019-11-07 01:06:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-11-07 01:06:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2918 transitions. [2019-11-07 01:06:43,616 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2918 transitions. Word has length 159 [2019-11-07 01:06:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:43,617 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2918 transitions. [2019-11-07 01:06:43,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2918 transitions. [2019-11-07 01:06:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:06:43,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:43,623 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:06:43,623 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:43,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1379415471, now seen corresponding path program 1 times [2019-11-07 01:06:43,624 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:43,624 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833603251] [2019-11-07 01:06:43,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:43,794 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:06:43,795 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833603251] [2019-11-07 01:06:43,796 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:43,796 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:43,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891654682] [2019-11-07 01:06:43,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:43,797 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:43,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:43,798 INFO L87 Difference]: Start difference. First operand 1995 states and 2918 transitions. Second operand 4 states. [2019-11-07 01:06:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:43,943 INFO L93 Difference]: Finished difference Result 3337 states and 4898 transitions. [2019-11-07 01:06:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:43,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-07 01:06:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:43,952 INFO L225 Difference]: With dead ends: 3337 [2019-11-07 01:06:43,952 INFO L226 Difference]: Without dead ends: 1528 [2019-11-07 01:06:43,956 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:06:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2019-11-07 01:06:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2019-11-07 01:06:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-11-07 01:06:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2228 transitions. [2019-11-07 01:06:44,045 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2228 transitions. Word has length 159 [2019-11-07 01:06:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:44,045 INFO L462 AbstractCegarLoop]: Abstraction has 1528 states and 2228 transitions. [2019-11-07 01:06:44,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2228 transitions. [2019-11-07 01:06:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:06:44,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:44,056 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:06:44,057 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash -51426036, now seen corresponding path program 1 times [2019-11-07 01:06:44,058 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:44,060 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395163902] [2019-11-07 01:06:44,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:44,176 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:06:44,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395163902] [2019-11-07 01:06:44,176 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:44,176 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:44,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739049000] [2019-11-07 01:06:44,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:44,177 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:44,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:44,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:44,178 INFO L87 Difference]: Start difference. First operand 1528 states and 2228 transitions. Second operand 3 states. [2019-11-07 01:06:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:44,324 INFO L93 Difference]: Finished difference Result 3607 states and 5375 transitions. [2019-11-07 01:06:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:44,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-07 01:06:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:44,336 INFO L225 Difference]: With dead ends: 3607 [2019-11-07 01:06:44,336 INFO L226 Difference]: Without dead ends: 2268 [2019-11-07 01:06:44,340 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:06:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-11-07 01:06:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1952. [2019-11-07 01:06:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-11-07 01:06:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2916 transitions. [2019-11-07 01:06:44,444 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2916 transitions. Word has length 161 [2019-11-07 01:06:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:44,445 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2916 transitions. [2019-11-07 01:06:44,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2916 transitions. [2019-11-07 01:06:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:06:44,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:44,449 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, 1, 1] [2019-11-07 01:06:44,449 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash -541662678, now seen corresponding path program 1 times [2019-11-07 01:06:44,450 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:44,450 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293176253] [2019-11-07 01:06:44,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:44,629 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:06:44,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293176253] [2019-11-07 01:06:44,630 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:44,630 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:44,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321459111] [2019-11-07 01:06:44,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:44,631 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:44,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:44,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:44,632 INFO L87 Difference]: Start difference. First operand 1952 states and 2916 transitions. Second operand 3 states. [2019-11-07 01:06:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:44,809 INFO L93 Difference]: Finished difference Result 4665 states and 7121 transitions. [2019-11-07 01:06:44,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:44,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-07 01:06:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:44,824 INFO L225 Difference]: With dead ends: 4665 [2019-11-07 01:06:44,824 INFO L226 Difference]: Without dead ends: 2986 [2019-11-07 01:06:44,829 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:06:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-11-07 01:06:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2706. [2019-11-07 01:06:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-11-07 01:06:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4137 transitions. [2019-11-07 01:06:44,973 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4137 transitions. Word has length 163 [2019-11-07 01:06:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:44,973 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 4137 transitions. [2019-11-07 01:06:44,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4137 transitions. [2019-11-07 01:06:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-07 01:06:44,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:44,978 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, 1, 1, 1] [2019-11-07 01:06:44,978 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:44,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:44,978 INFO L82 PathProgramCache]: Analyzing trace with hash 911873176, now seen corresponding path program 1 times [2019-11-07 01:06:44,979 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:44,979 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29057923] [2019-11-07 01:06:44,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:45,182 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:06:45,182 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29057923] [2019-11-07 01:06:45,183 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:45,183 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:45,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813934392] [2019-11-07 01:06:45,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:45,185 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:45,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:45,185 INFO L87 Difference]: Start difference. First operand 2706 states and 4137 transitions. Second operand 5 states. [2019-11-07 01:06:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:45,903 INFO L93 Difference]: Finished difference Result 7601 states and 11754 transitions. [2019-11-07 01:06:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:45,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-11-07 01:06:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:45,938 INFO L225 Difference]: With dead ends: 7601 [2019-11-07 01:06:45,938 INFO L226 Difference]: Without dead ends: 5078 [2019-11-07 01:06:45,947 INFO L630 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-11-07 01:06:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-11-07 01:06:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5076. [2019-11-07 01:06:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-11-07 01:06:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7791 transitions. [2019-11-07 01:06:46,388 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7791 transitions. Word has length 164 [2019-11-07 01:06:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:46,388 INFO L462 AbstractCegarLoop]: Abstraction has 5076 states and 7791 transitions. [2019-11-07 01:06:46,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7791 transitions. [2019-11-07 01:06:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-07 01:06:46,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:46,394 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, 1, 1, 1] [2019-11-07 01:06:46,394 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2112908957, now seen corresponding path program 1 times [2019-11-07 01:06:46,395 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:46,395 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594036862] [2019-11-07 01:06:46,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:46,631 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:06:46,631 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594036862] [2019-11-07 01:06:46,631 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:46,631 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:46,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037192354] [2019-11-07 01:06:46,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:46,632 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:46,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:46,633 INFO L87 Difference]: Start difference. First operand 5076 states and 7791 transitions. Second operand 4 states. [2019-11-07 01:06:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:47,280 INFO L93 Difference]: Finished difference Result 13239 states and 20333 transitions. [2019-11-07 01:06:47,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:47,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-07 01:06:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:47,321 INFO L225 Difference]: With dead ends: 13239 [2019-11-07 01:06:47,322 INFO L226 Difference]: Without dead ends: 8194 [2019-11-07 01:06:47,331 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:06:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-11-07 01:06:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8192. [2019-11-07 01:06:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-11-07 01:06:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12471 transitions. [2019-11-07 01:06:47,809 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12471 transitions. Word has length 164 [2019-11-07 01:06:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:47,810 INFO L462 AbstractCegarLoop]: Abstraction has 8192 states and 12471 transitions. [2019-11-07 01:06:47,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12471 transitions. [2019-11-07 01:06:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:06:47,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:47,817 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, 1, 1, 1, 1, 1] [2019-11-07 01:06:47,817 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1008257189, now seen corresponding path program 1 times [2019-11-07 01:06:47,818 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:47,818 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903616956] [2019-11-07 01:06:47,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:48,012 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:06:48,012 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903616956] [2019-11-07 01:06:48,013 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:48,013 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:48,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404103038] [2019-11-07 01:06:48,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:48,014 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:48,014 INFO L87 Difference]: Start difference. First operand 8192 states and 12471 transitions. Second operand 3 states. [2019-11-07 01:06:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:48,594 INFO L93 Difference]: Finished difference Result 20555 states and 31330 transitions. [2019-11-07 01:06:48,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:48,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-07 01:06:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:48,624 INFO L225 Difference]: With dead ends: 20555 [2019-11-07 01:06:48,624 INFO L226 Difference]: Without dead ends: 12739 [2019-11-07 01:06:48,642 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:06:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-11-07 01:06:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 12737. [2019-11-07 01:06:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-11-07 01:06:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 19158 transitions. [2019-11-07 01:06:49,396 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 19158 transitions. Word has length 166 [2019-11-07 01:06:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:49,396 INFO L462 AbstractCegarLoop]: Abstraction has 12737 states and 19158 transitions. [2019-11-07 01:06:49,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 19158 transitions. [2019-11-07 01:06:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-07 01:06:49,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:49,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:49,409 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1356015054, now seen corresponding path program 1 times [2019-11-07 01:06:49,409 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:49,409 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512344499] [2019-11-07 01:06:49,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:49,509 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:06:49,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512344499] [2019-11-07 01:06:49,509 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:49,510 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:49,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267278049] [2019-11-07 01:06:49,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:49,511 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:49,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:49,512 INFO L87 Difference]: Start difference. First operand 12737 states and 19158 transitions. Second operand 3 states. [2019-11-07 01:06:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:50,597 INFO L93 Difference]: Finished difference Result 33839 states and 51503 transitions. [2019-11-07 01:06:50,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:50,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-07 01:06:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:50,643 INFO L225 Difference]: With dead ends: 33839 [2019-11-07 01:06:50,644 INFO L226 Difference]: Without dead ends: 21443 [2019-11-07 01:06:50,671 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:06:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21443 states. [2019-11-07 01:06:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21443 to 19533. [2019-11-07 01:06:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-11-07 01:06:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 29933 transitions. [2019-11-07 01:06:52,167 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 29933 transitions. Word has length 170 [2019-11-07 01:06:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:52,167 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 29933 transitions. [2019-11-07 01:06:52,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 29933 transitions. [2019-11-07 01:06:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-07 01:06:52,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:52,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:52,179 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash -927051742, now seen corresponding path program 1 times [2019-11-07 01:06:52,179 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:52,179 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979415947] [2019-11-07 01:06:52,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:52,390 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:06:52,391 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979415947] [2019-11-07 01:06:52,391 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:52,391 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:06:52,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236512984] [2019-11-07 01:06:52,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:06:52,392 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:06:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:06:52,393 INFO L87 Difference]: Start difference. First operand 19533 states and 29933 transitions. Second operand 8 states. [2019-11-07 01:06:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:56,225 INFO L93 Difference]: Finished difference Result 80177 states and 123376 transitions. [2019-11-07 01:06:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:06:56,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2019-11-07 01:06:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:56,363 INFO L225 Difference]: With dead ends: 80177 [2019-11-07 01:06:56,363 INFO L226 Difference]: Without dead ends: 61059 [2019-11-07 01:06:56,402 INFO L630 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-11-07 01:06:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61059 states. [2019-11-07 01:06:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61059 to 32625. [2019-11-07 01:06:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32625 states. [2019-11-07 01:06:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32625 states to 32625 states and 49361 transitions. [2019-11-07 01:06:58,433 INFO L78 Accepts]: Start accepts. Automaton has 32625 states and 49361 transitions. Word has length 171 [2019-11-07 01:06:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:58,434 INFO L462 AbstractCegarLoop]: Abstraction has 32625 states and 49361 transitions. [2019-11-07 01:06:58,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:06:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32625 states and 49361 transitions. [2019-11-07 01:06:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-07 01:06:58,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:58,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:58,470 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash 299202232, now seen corresponding path program 1 times [2019-11-07 01:06:58,470 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:58,470 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781938116] [2019-11-07 01:06:58,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:58,985 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:06:58,985 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781938116] [2019-11-07 01:06:58,988 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:58,988 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:58,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94285377] [2019-11-07 01:06:58,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:58,989 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:58,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:58,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:58,990 INFO L87 Difference]: Start difference. First operand 32625 states and 49361 transitions. Second operand 4 states. [2019-11-07 01:07:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:02,038 INFO L93 Difference]: Finished difference Result 90603 states and 136692 transitions. [2019-11-07 01:07:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:02,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-07 01:07:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:02,120 INFO L225 Difference]: With dead ends: 90603 [2019-11-07 01:07:02,120 INFO L226 Difference]: Without dead ends: 58021 [2019-11-07 01:07:02,163 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:07:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58021 states. [2019-11-07 01:07:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58021 to 58019. [2019-11-07 01:07:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58019 states. [2019-11-07 01:07:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58019 states to 58019 states and 86398 transitions. [2019-11-07 01:07:05,065 INFO L78 Accepts]: Start accepts. Automaton has 58019 states and 86398 transitions. Word has length 171 [2019-11-07 01:07:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:05,065 INFO L462 AbstractCegarLoop]: Abstraction has 58019 states and 86398 transitions. [2019-11-07 01:07:05,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 58019 states and 86398 transitions. [2019-11-07 01:07:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-07 01:07:05,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:05,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:05,079 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:05,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash -996193854, now seen corresponding path program 1 times [2019-11-07 01:07:05,080 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:05,080 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333868666] [2019-11-07 01:07:05,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:05,145 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:07:05,145 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333868666] [2019-11-07 01:07:05,146 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:05,146 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:05,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91262401] [2019-11-07 01:07:05,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:05,147 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:05,147 INFO L87 Difference]: Start difference. First operand 58019 states and 86398 transitions. Second operand 3 states. [2019-11-07 01:07:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:11,258 INFO L93 Difference]: Finished difference Result 173855 states and 258937 transitions. [2019-11-07 01:07:11,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:11,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-07 01:07:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:11,480 INFO L225 Difference]: With dead ends: 173855 [2019-11-07 01:07:11,481 INFO L226 Difference]: Without dead ends: 115946 [2019-11-07 01:07:11,567 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:07:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115946 states.