/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.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:04:55,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:04:55,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:04:55,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:04:55,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:04:55,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:04:55,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:04:55,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:04:55,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:04:55,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:04:55,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:04:55,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:04:55,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:04:55,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:04:55,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:04:55,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:04:55,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:04:55,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:04:55,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:04:55,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:04:55,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:04:55,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:04:55,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:04:55,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:04:55,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:04:55,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:04:55,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:04:55,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:04:55,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:04:55,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:04:55,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:04:55,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:04:55,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:04:55,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:04:55,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:04:55,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:04:55,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:04:55,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:04:55,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:04:55,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:04:55,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:04:55,175 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:55,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:04:55,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:04:55,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:04:55,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:04:55,216 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:04:55,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:04:55,216 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:04:55,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:04:55,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:04:55,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:04:55,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:04:55,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:04:55,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:04:55,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:04:55,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:04:55,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:04:55,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:04:55,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:04:55,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:04:55,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:04:55,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:04:55,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:04:55,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:04:55,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:04:55,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:04:55,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:04:55,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:04:55,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:04:55,220 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:55,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:04:55,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:04:55,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:04:55,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:04:55,565 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:04:55,566 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.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:04:55,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a2d626/7991b8eb3fdc4890b62ad86ef9a30714/FLAG296549e11 [2019-11-07 01:04:56,206 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:04:56,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:04:56,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a2d626/7991b8eb3fdc4890b62ad86ef9a30714/FLAG296549e11 [2019-11-07 01:04:56,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a2d626/7991b8eb3fdc4890b62ad86ef9a30714 [2019-11-07 01:04:56,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:04:56,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:04:56,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:56,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:04:56,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:04:56,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:56" (1/1) ... [2019-11-07 01:04:56,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2d1ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:56, skipping insertion in model container [2019-11-07 01:04:56,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:56" (1/1) ... [2019-11-07 01:04:56,498 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:04:56,566 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:04:57,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:57,190 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:04:57,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:57,661 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:04:57,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:57 WrapperNode [2019-11-07 01:04:57,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:57,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:04:57,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:04:57,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:04:57,672 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:57" (1/1) ... [2019-11-07 01:04:57,673 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:57" (1/1) ... [2019-11-07 01:04:57,692 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:57" (1/1) ... [2019-11-07 01:04:57,692 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:57" (1/1) ... [2019-11-07 01:04:57,724 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:57" (1/1) ... [2019-11-07 01:04:57,750 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:57" (1/1) ... [2019-11-07 01:04:57,756 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:57" (1/1) ... [2019-11-07 01:04:57,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:04:57,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:04:57,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:04:57,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:04:57,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:57" (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:57,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:04:57,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:04:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:04:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:04:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:04:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:04:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:04:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:04:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:04:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:04:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:04:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:04:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:04:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:04:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:04:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:04:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:04:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:04:59,397 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:04:59,398 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:04:59,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:59 BoogieIcfgContainer [2019-11-07 01:04:59,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:04:59,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:04:59,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:04:59,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:04:59,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:56" (1/3) ... [2019-11-07 01:04:59,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2df9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:59, skipping insertion in model container [2019-11-07 01:04:59,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:57" (2/3) ... [2019-11-07 01:04:59,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2df9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:59, skipping insertion in model container [2019-11-07 01:04:59,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:59" (3/3) ... [2019-11-07 01:04:59,408 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:04:59,418 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:04:59,428 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:04:59,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:04:59,470 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:04:59,471 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:04:59,471 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:04:59,471 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:04:59,471 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:04:59,471 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:04:59,472 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:04:59,472 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:04:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states. [2019-11-07 01:04:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 01:04:59,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:59,517 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] [2019-11-07 01:04:59,519 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:59,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash -737000611, now seen corresponding path program 1 times [2019-11-07 01:04:59,536 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:59,536 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890545693] [2019-11-07 01:04:59,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:00,324 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:00,325 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890545693] [2019-11-07 01:05:00,326 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:00,327 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:00,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628055074] [2019-11-07 01:05:00,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:00,336 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:00,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:00,354 INFO L87 Difference]: Start difference. First operand 371 states. Second operand 3 states. [2019-11-07 01:05:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:00,584 INFO L93 Difference]: Finished difference Result 667 states and 1188 transitions. [2019-11-07 01:05:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:00,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-07 01:05:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:00,607 INFO L225 Difference]: With dead ends: 667 [2019-11-07 01:05:00,608 INFO L226 Difference]: Without dead ends: 520 [2019-11-07 01:05:00,612 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:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-07 01:05:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2019-11-07 01:05:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-07 01:05:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 755 transitions. [2019-11-07 01:05:00,711 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 755 transitions. Word has length 140 [2019-11-07 01:05:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:00,712 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 755 transitions. [2019-11-07 01:05:00,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 755 transitions. [2019-11-07 01:05:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 01:05:00,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:00,718 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] [2019-11-07 01:05:00,718 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:00,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1264797844, now seen corresponding path program 1 times [2019-11-07 01:05:00,719 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:00,719 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362498351] [2019-11-07 01:05:00,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:00,863 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:00,863 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362498351] [2019-11-07 01:05:00,866 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:00,866 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:00,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518250079] [2019-11-07 01:05:00,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:00,869 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:00,870 INFO L87 Difference]: Start difference. First operand 518 states and 755 transitions. Second operand 3 states. [2019-11-07 01:05:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:01,075 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-11-07 01:05:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:01,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-07 01:05:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:01,083 INFO L225 Difference]: With dead ends: 1029 [2019-11-07 01:05:01,083 INFO L226 Difference]: Without dead ends: 824 [2019-11-07 01:05:01,086 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:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-11-07 01:05:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 822. [2019-11-07 01:05:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-11-07 01:05:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1219 transitions. [2019-11-07 01:05:01,141 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1219 transitions. Word has length 140 [2019-11-07 01:05:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:01,142 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1219 transitions. [2019-11-07 01:05:01,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1219 transitions. [2019-11-07 01:05:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 01:05:01,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:01,151 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] [2019-11-07 01:05:01,152 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1075415587, now seen corresponding path program 1 times [2019-11-07 01:05:01,154 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:01,155 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700931098] [2019-11-07 01:05:01,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:01,345 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:01,346 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700931098] [2019-11-07 01:05:01,346 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:01,346 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:01,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992881765] [2019-11-07 01:05:01,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:01,349 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:01,350 INFO L87 Difference]: Start difference. First operand 822 states and 1219 transitions. Second operand 3 states. [2019-11-07 01:05:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:01,563 INFO L93 Difference]: Finished difference Result 1781 states and 2727 transitions. [2019-11-07 01:05:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:01,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-07 01:05:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:01,577 INFO L225 Difference]: With dead ends: 1781 [2019-11-07 01:05:01,577 INFO L226 Difference]: Without dead ends: 1436 [2019-11-07 01:05:01,594 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:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-11-07 01:05:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1434. [2019-11-07 01:05:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-11-07 01:05:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2151 transitions. [2019-11-07 01:05:01,678 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2151 transitions. Word has length 140 [2019-11-07 01:05:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:01,681 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 2151 transitions. [2019-11-07 01:05:01,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2151 transitions. [2019-11-07 01:05:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 01:05:01,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:01,689 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] [2019-11-07 01:05:01,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1075754211, now seen corresponding path program 1 times [2019-11-07 01:05:01,690 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:01,690 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207006929] [2019-11-07 01:05:01,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:02,191 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:02,191 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207006929] [2019-11-07 01:05:02,191 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:02,191 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:02,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239766050] [2019-11-07 01:05:02,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:02,192 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:02,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:02,193 INFO L87 Difference]: Start difference. First operand 1434 states and 2151 transitions. Second operand 4 states. [2019-11-07 01:05:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:02,402 INFO L93 Difference]: Finished difference Result 4221 states and 6322 transitions. [2019-11-07 01:05:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:02,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-07 01:05:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:02,421 INFO L225 Difference]: With dead ends: 4221 [2019-11-07 01:05:02,421 INFO L226 Difference]: Without dead ends: 2800 [2019-11-07 01:05:02,425 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:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-11-07 01:05:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2760. [2019-11-07 01:05:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-11-07 01:05:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4117 transitions. [2019-11-07 01:05:02,571 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4117 transitions. Word has length 140 [2019-11-07 01:05:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:02,571 INFO L462 AbstractCegarLoop]: Abstraction has 2760 states and 4117 transitions. [2019-11-07 01:05:02,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4117 transitions. [2019-11-07 01:05:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:05:02,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:02,577 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] [2019-11-07 01:05:02,578 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:02,578 INFO L82 PathProgramCache]: Analyzing trace with hash -127121487, now seen corresponding path program 1 times [2019-11-07 01:05:02,578 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:02,579 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304748817] [2019-11-07 01:05:02,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:02,704 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:02,705 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304748817] [2019-11-07 01:05:02,705 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:02,705 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:02,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377613966] [2019-11-07 01:05:02,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:02,706 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:02,708 INFO L87 Difference]: Start difference. First operand 2760 states and 4117 transitions. Second operand 3 states. [2019-11-07 01:05:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:02,984 INFO L93 Difference]: Finished difference Result 8234 states and 12281 transitions. [2019-11-07 01:05:02,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:02,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-07 01:05:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:03,021 INFO L225 Difference]: With dead ends: 8234 [2019-11-07 01:05:03,021 INFO L226 Difference]: Without dead ends: 5506 [2019-11-07 01:05:03,030 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:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2019-11-07 01:05:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 2762. [2019-11-07 01:05:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-11-07 01:05:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4119 transitions. [2019-11-07 01:05:03,260 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4119 transitions. Word has length 141 [2019-11-07 01:05:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:03,260 INFO L462 AbstractCegarLoop]: Abstraction has 2762 states and 4119 transitions. [2019-11-07 01:05:03,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4119 transitions. [2019-11-07 01:05:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 01:05:03,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:03,265 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] [2019-11-07 01:05:03,266 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:03,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:03,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1322555170, now seen corresponding path program 1 times [2019-11-07 01:05:03,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:03,267 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798972063] [2019-11-07 01:05:03,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:03,515 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,515 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798972063] [2019-11-07 01:05:03,515 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:03,515 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:03,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091883120] [2019-11-07 01:05:03,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:03,516 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:03,517 INFO L87 Difference]: Start difference. First operand 2762 states and 4119 transitions. Second operand 4 states. [2019-11-07 01:05:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:03,686 INFO L93 Difference]: Finished difference Result 5510 states and 8220 transitions. [2019-11-07 01:05:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:03,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-07 01:05:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:03,705 INFO L225 Difference]: With dead ends: 5510 [2019-11-07 01:05:03,705 INFO L226 Difference]: Without dead ends: 2760 [2019-11-07 01:05:03,711 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:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2019-11-07 01:05:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2760. [2019-11-07 01:05:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-11-07 01:05:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4115 transitions. [2019-11-07 01:05:03,859 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4115 transitions. Word has length 142 [2019-11-07 01:05:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:03,859 INFO L462 AbstractCegarLoop]: Abstraction has 2760 states and 4115 transitions. [2019-11-07 01:05:03,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4115 transitions. [2019-11-07 01:05:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 01:05:03,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:03,869 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] [2019-11-07 01:05:03,869 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash -82288669, now seen corresponding path program 1 times [2019-11-07 01:05:03,870 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:03,870 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978594250] [2019-11-07 01:05:03,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:03,967 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,967 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978594250] [2019-11-07 01:05:03,967 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:03,967 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:03,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572607641] [2019-11-07 01:05:03,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:03,968 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:03,970 INFO L87 Difference]: Start difference. First operand 2760 states and 4115 transitions. Second operand 3 states. [2019-11-07 01:05:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:04,263 INFO L93 Difference]: Finished difference Result 6674 states and 9953 transitions. [2019-11-07 01:05:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:04,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-07 01:05:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:04,285 INFO L225 Difference]: With dead ends: 6674 [2019-11-07 01:05:04,285 INFO L226 Difference]: Without dead ends: 4094 [2019-11-07 01:05:04,291 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:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2019-11-07 01:05:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 4054. [2019-11-07 01:05:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4054 states. [2019-11-07 01:05:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 5963 transitions. [2019-11-07 01:05:04,513 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 5963 transitions. Word has length 142 [2019-11-07 01:05:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:04,513 INFO L462 AbstractCegarLoop]: Abstraction has 4054 states and 5963 transitions. [2019-11-07 01:05:04,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 5963 transitions. [2019-11-07 01:05:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 01:05:04,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:04,520 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:05:04,520 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1177772960, now seen corresponding path program 1 times [2019-11-07 01:05:04,521 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:04,521 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243637074] [2019-11-07 01:05:04,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:04,699 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:04,699 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243637074] [2019-11-07 01:05:04,699 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:04,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:05:04,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873939414] [2019-11-07 01:05:04,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:05:04,701 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:05:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:04,701 INFO L87 Difference]: Start difference. First operand 4054 states and 5963 transitions. Second operand 8 states. [2019-11-07 01:05:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:06,314 INFO L93 Difference]: Finished difference Result 13639 states and 20990 transitions. [2019-11-07 01:05:06,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:05:06,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-11-07 01:05:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:06,375 INFO L225 Difference]: With dead ends: 13639 [2019-11-07 01:05:06,375 INFO L226 Difference]: Without dead ends: 9790 [2019-11-07 01:05:06,383 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:05:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2019-11-07 01:05:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 5376. [2019-11-07 01:05:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2019-11-07 01:05:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 7951 transitions. [2019-11-07 01:05:06,759 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 7951 transitions. Word has length 145 [2019-11-07 01:05:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:06,760 INFO L462 AbstractCegarLoop]: Abstraction has 5376 states and 7951 transitions. [2019-11-07 01:05:06,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:05:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 7951 transitions. [2019-11-07 01:05:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 01:05:06,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:06,766 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:05:06,767 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash -142350002, now seen corresponding path program 1 times [2019-11-07 01:05:06,767 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:06,768 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872488846] [2019-11-07 01:05:06,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:06,984 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:06,985 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872488846] [2019-11-07 01:05:06,985 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:06,985 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:06,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175503900] [2019-11-07 01:05:06,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:06,986 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:06,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:06,987 INFO L87 Difference]: Start difference. First operand 5376 states and 7951 transitions. Second operand 4 states. [2019-11-07 01:05:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:07,626 INFO L93 Difference]: Finished difference Result 14463 states and 21402 transitions. [2019-11-07 01:05:07,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:07,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-07 01:05:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:07,649 INFO L225 Difference]: With dead ends: 14463 [2019-11-07 01:05:07,650 INFO L226 Difference]: Without dead ends: 9110 [2019-11-07 01:05:07,665 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:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9110 states. [2019-11-07 01:05:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9110 to 9080. [2019-11-07 01:05:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9080 states. [2019-11-07 01:05:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 13336 transitions. [2019-11-07 01:05:08,301 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 13336 transitions. Word has length 145 [2019-11-07 01:05:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:08,301 INFO L462 AbstractCegarLoop]: Abstraction has 9080 states and 13336 transitions. [2019-11-07 01:05:08,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 13336 transitions. [2019-11-07 01:05:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:08,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:08,310 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] [2019-11-07 01:05:08,311 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash -140462378, now seen corresponding path program 1 times [2019-11-07 01:05:08,311 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:08,312 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853649466] [2019-11-07 01:05:08,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:08,411 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:08,411 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853649466] [2019-11-07 01:05:08,412 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:08,412 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:08,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451867266] [2019-11-07 01:05:08,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:08,414 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:08,414 INFO L87 Difference]: Start difference. First operand 9080 states and 13336 transitions. Second operand 3 states. [2019-11-07 01:05:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:09,342 INFO L93 Difference]: Finished difference Result 24470 states and 36012 transitions. [2019-11-07 01:05:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:09,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-07 01:05:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:09,381 INFO L225 Difference]: With dead ends: 24470 [2019-11-07 01:05:09,381 INFO L226 Difference]: Without dead ends: 15751 [2019-11-07 01:05:09,406 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:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15751 states. [2019-11-07 01:05:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15751 to 15725. [2019-11-07 01:05:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-11-07 01:05:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 22868 transitions. [2019-11-07 01:05:10,532 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 22868 transitions. Word has length 147 [2019-11-07 01:05:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:10,533 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 22868 transitions. [2019-11-07 01:05:10,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 22868 transitions. [2019-11-07 01:05:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:10,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:10,547 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] [2019-11-07 01:05:10,548 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -35990567, now seen corresponding path program 1 times [2019-11-07 01:05:10,549 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:10,549 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070503775] [2019-11-07 01:05:10,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:10,705 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:10,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070503775] [2019-11-07 01:05:10,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:10,706 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:10,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068964955] [2019-11-07 01:05:10,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:10,707 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:10,708 INFO L87 Difference]: Start difference. First operand 15725 states and 22868 transitions. Second operand 4 states. [2019-11-07 01:05:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:11,308 INFO L93 Difference]: Finished difference Result 26933 states and 39252 transitions. [2019-11-07 01:05:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:11,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-07 01:05:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:11,341 INFO L225 Difference]: With dead ends: 26933 [2019-11-07 01:05:11,341 INFO L226 Difference]: Without dead ends: 13923 [2019-11-07 01:05:11,371 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:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states. [2019-11-07 01:05:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13923. [2019-11-07 01:05:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13923 states. [2019-11-07 01:05:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 20193 transitions. [2019-11-07 01:05:12,563 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 20193 transitions. Word has length 147 [2019-11-07 01:05:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:12,564 INFO L462 AbstractCegarLoop]: Abstraction has 13923 states and 20193 transitions. [2019-11-07 01:05:12,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 20193 transitions. [2019-11-07 01:05:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:05:12,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:12,576 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] [2019-11-07 01:05:12,576 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash 274548163, now seen corresponding path program 1 times [2019-11-07 01:05:12,577 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:12,577 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085155682] [2019-11-07 01:05:12,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:12,766 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,766 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085155682] [2019-11-07 01:05:12,766 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:12,766 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:12,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877881422] [2019-11-07 01:05:12,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:12,767 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:12,768 INFO L87 Difference]: Start difference. First operand 13923 states and 20193 transitions. Second operand 4 states. [2019-11-07 01:05:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:14,183 INFO L93 Difference]: Finished difference Result 40726 states and 59115 transitions. [2019-11-07 01:05:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:14,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-07 01:05:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:14,238 INFO L225 Difference]: With dead ends: 40726 [2019-11-07 01:05:14,238 INFO L226 Difference]: Without dead ends: 26846 [2019-11-07 01:05:14,263 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:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26846 states. [2019-11-07 01:05:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26846 to 26786. [2019-11-07 01:05:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26786 states. [2019-11-07 01:05:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26786 states to 26786 states and 38548 transitions. [2019-11-07 01:05:15,744 INFO L78 Accepts]: Start accepts. Automaton has 26786 states and 38548 transitions. Word has length 150 [2019-11-07 01:05:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:15,744 INFO L462 AbstractCegarLoop]: Abstraction has 26786 states and 38548 transitions. [2019-11-07 01:05:15,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 26786 states and 38548 transitions. [2019-11-07 01:05:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:05:15,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:15,762 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:05:15,762 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1258286695, now seen corresponding path program 1 times [2019-11-07 01:05:15,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:15,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829177778] [2019-11-07 01:05:15,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:15,821 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829177778] [2019-11-07 01:05:15,821 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:15,821 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:15,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830420320] [2019-11-07 01:05:15,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:15,822 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:15,823 INFO L87 Difference]: Start difference. First operand 26786 states and 38548 transitions. Second operand 3 states. [2019-11-07 01:05:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:18,349 INFO L93 Difference]: Finished difference Result 80164 states and 115393 transitions. [2019-11-07 01:05:18,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:18,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-07 01:05:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:18,458 INFO L225 Difference]: With dead ends: 80164 [2019-11-07 01:05:18,459 INFO L226 Difference]: Without dead ends: 53484 [2019-11-07 01:05:18,502 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,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53484 states. [2019-11-07 01:05:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53484 to 26792. [2019-11-07 01:05:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26792 states. [2019-11-07 01:05:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26792 states to 26792 states and 38554 transitions. [2019-11-07 01:05:20,245 INFO L78 Accepts]: Start accepts. Automaton has 26792 states and 38554 transitions. Word has length 151 [2019-11-07 01:05:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:20,245 INFO L462 AbstractCegarLoop]: Abstraction has 26792 states and 38554 transitions. [2019-11-07 01:05:20,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26792 states and 38554 transitions. [2019-11-07 01:05:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:05:20,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:20,258 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] [2019-11-07 01:05:20,258 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1962958739, now seen corresponding path program 1 times [2019-11-07 01:05:20,259 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:20,259 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759919685] [2019-11-07 01:05:20,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:20,360 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:20,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759919685] [2019-11-07 01:05:20,361 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:20,361 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:20,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684719351] [2019-11-07 01:05:20,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:20,362 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:20,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:20,363 INFO L87 Difference]: Start difference. First operand 26792 states and 38554 transitions. Second operand 3 states. [2019-11-07 01:05:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:22,519 INFO L93 Difference]: Finished difference Result 71898 states and 103214 transitions. [2019-11-07 01:05:22,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:22,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-07 01:05:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:22,611 INFO L225 Difference]: With dead ends: 71898 [2019-11-07 01:05:22,611 INFO L226 Difference]: Without dead ends: 45796 [2019-11-07 01:05:22,649 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:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45796 states. [2019-11-07 01:05:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45796 to 45736. [2019-11-07 01:05:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45736 states. [2019-11-07 01:05:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45736 states to 45736 states and 64696 transitions. [2019-11-07 01:05:25,842 INFO L78 Accepts]: Start accepts. Automaton has 45736 states and 64696 transitions. Word has length 152 [2019-11-07 01:05:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:25,843 INFO L462 AbstractCegarLoop]: Abstraction has 45736 states and 64696 transitions. [2019-11-07 01:05:25,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 45736 states and 64696 transitions. [2019-11-07 01:05:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:05:25,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:25,863 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] [2019-11-07 01:05:25,863 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash 800440458, now seen corresponding path program 1 times [2019-11-07 01:05:25,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:25,864 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938622384] [2019-11-07 01:05:25,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:26,006 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:26,006 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938622384] [2019-11-07 01:05:26,007 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:26,007 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:26,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157985822] [2019-11-07 01:05:26,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:26,008 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:26,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:26,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:26,009 INFO L87 Difference]: Start difference. First operand 45736 states and 64696 transitions. Second operand 4 states. [2019-11-07 01:05:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:27,976 INFO L93 Difference]: Finished difference Result 84797 states and 119985 transitions. [2019-11-07 01:05:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:27,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-07 01:05:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:28,024 INFO L225 Difference]: With dead ends: 84797 [2019-11-07 01:05:28,025 INFO L226 Difference]: Without dead ends: 39689 [2019-11-07 01:05:28,064 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:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39689 states.