/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:04:48,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:04:48,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:04:48,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:04:48,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:04:48,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:04:48,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:04:48,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:04:48,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:04:48,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:04:48,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:04:48,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:04:48,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:04:48,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:04:48,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:04:48,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:04:48,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:04:48,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:04:48,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:04:48,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:04:48,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:04:48,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:04:48,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:04:48,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:04:48,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:04:48,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:04:48,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:04:48,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:04:48,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:04:48,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:04:48,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:04:48,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:04:48,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:04:48,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:04:48,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:04:48,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:04:48,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:04:48,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:04:48,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:04:48,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:04:48,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:04:48,363 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:48,387 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:04:48,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:04:48,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:04:48,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:04:48,390 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:04:48,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:04:48,390 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:04:48,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:04:48,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:04:48,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:04:48,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:04:48,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:04:48,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:04:48,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:04:48,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:04:48,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:04:48,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:04:48,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:04:48,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:04:48,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:04:48,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:04:48,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:04:48,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:04:48,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:04:48,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:04:48,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:04:48,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:04:48,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:04:48,396 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:48,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:04:48,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:04:48,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:04:48,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:04:48,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:04:48,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:04:48,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2545b3a/55b0f0b22bd7475a86cdc79b3bd462f6/FLAG07d95dc26 [2019-11-07 01:04:49,280 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:04:49,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:04:49,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2545b3a/55b0f0b22bd7475a86cdc79b3bd462f6/FLAG07d95dc26 [2019-11-07 01:04:49,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2545b3a/55b0f0b22bd7475a86cdc79b3bd462f6 [2019-11-07 01:04:49,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:04:49,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:04:49,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:49,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:04:49,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:04:49,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c858567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:49, skipping insertion in model container [2019-11-07 01:04:49,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:49" (1/1) ... [2019-11-07 01:04:49,617 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:04:49,677 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:04:50,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:50,205 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:04:50,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:50,401 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:04:50,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:50 WrapperNode [2019-11-07 01:04:50,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:50,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:04:50,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:04:50,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:04:50,414 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:50" (1/1) ... [2019-11-07 01:04:50,414 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:50" (1/1) ... [2019-11-07 01:04:50,435 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:50" (1/1) ... [2019-11-07 01:04:50,435 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:50" (1/1) ... [2019-11-07 01:04:50,462 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:50" (1/1) ... [2019-11-07 01:04:50,485 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:50" (1/1) ... [2019-11-07 01:04:50,504 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:50" (1/1) ... [2019-11-07 01:04:50,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:04:50,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:04:50,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:04:50,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:04:50,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:50" (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:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:04:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:04:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:04:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:04:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:04:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:04:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:04:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:04:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:04:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:04:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:04:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:04:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:04:52,118 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:04:52,118 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:04:52,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:52 BoogieIcfgContainer [2019-11-07 01:04:52,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:04:52,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:04:52,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:04:52,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:04:52,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:49" (1/3) ... [2019-11-07 01:04:52,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4120cd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:52, skipping insertion in model container [2019-11-07 01:04:52,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:50" (2/3) ... [2019-11-07 01:04:52,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4120cd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:52, skipping insertion in model container [2019-11-07 01:04:52,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:52" (3/3) ... [2019-11-07 01:04:52,128 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:04:52,138 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:04:52,147 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:04:52,158 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:04:52,187 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:04:52,187 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:04:52,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:04:52,188 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:04:52,188 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:04:52,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:04:52,188 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:04:52,188 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:04:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-11-07 01:04:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-07 01:04:52,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:52,230 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] [2019-11-07 01:04:52,232 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:52,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-11-07 01:04:52,244 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:52,245 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607060162] [2019-11-07 01:04:52,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:52,934 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607060162] [2019-11-07 01:04:52,935 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:52,935 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:52,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951500527] [2019-11-07 01:04:52,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:52,945 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:52,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:52,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:52,963 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 3 states. [2019-11-07 01:04:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:53,294 INFO L93 Difference]: Finished difference Result 605 states and 1058 transitions. [2019-11-07 01:04:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:53,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-07 01:04:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:53,329 INFO L225 Difference]: With dead ends: 605 [2019-11-07 01:04:53,330 INFO L226 Difference]: Without dead ends: 493 [2019-11-07 01:04:53,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-07 01:04:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-11-07 01:04:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-11-07 01:04:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-11-07 01:04:53,476 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-11-07 01:04:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:53,480 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-11-07 01:04:53,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-11-07 01:04:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-07 01:04:53,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:53,493 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] [2019-11-07 01:04:53,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-11-07 01:04:53,494 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:53,494 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686055962] [2019-11-07 01:04:53,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:53,916 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686055962] [2019-11-07 01:04:53,916 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:53,916 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:53,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065285665] [2019-11-07 01:04:53,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:53,919 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:53,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:53,920 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 4 states. [2019-11-07 01:04:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:54,060 INFO L93 Difference]: Finished difference Result 1423 states and 2113 transitions. [2019-11-07 01:04:54,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:54,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-07 01:04:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:54,066 INFO L225 Difference]: With dead ends: 1423 [2019-11-07 01:04:54,066 INFO L226 Difference]: Without dead ends: 945 [2019-11-07 01:04:54,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:04:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-07 01:04:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-11-07 01:04:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-07 01:04:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-11-07 01:04:54,138 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-11-07 01:04:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:54,139 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-11-07 01:04:54,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-11-07 01:04:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:04:54,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:54,145 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] [2019-11-07 01:04:54,146 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-11-07 01:04:54,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:54,149 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970459986] [2019-11-07 01:04:54,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:54,259 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970459986] [2019-11-07 01:04:54,259 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:54,259 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:54,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375112689] [2019-11-07 01:04:54,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:54,261 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:54,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:54,262 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 3 states. [2019-11-07 01:04:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:54,377 INFO L93 Difference]: Finished difference Result 2783 states and 4097 transitions. [2019-11-07 01:04:54,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:54,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-07 01:04:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:54,389 INFO L225 Difference]: With dead ends: 2783 [2019-11-07 01:04:54,389 INFO L226 Difference]: Without dead ends: 1872 [2019-11-07 01:04:54,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-11-07 01:04:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-11-07 01:04:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-07 01:04:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-11-07 01:04:54,460 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-11-07 01:04:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:54,461 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-11-07 01:04:54,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-11-07 01:04:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:04:54,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:54,465 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:04:54,465 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-11-07 01:04:54,466 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:54,466 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635535126] [2019-11-07 01:04:54,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:54,713 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635535126] [2019-11-07 01:04:54,713 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:54,713 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:54,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586144216] [2019-11-07 01:04:54,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:54,714 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:54,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:54,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:54,715 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 4 states. [2019-11-07 01:04:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:54,811 INFO L93 Difference]: Finished difference Result 1876 states and 2764 transitions. [2019-11-07 01:04:54,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:54,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-07 01:04:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:54,819 INFO L225 Difference]: With dead ends: 1876 [2019-11-07 01:04:54,819 INFO L226 Difference]: Without dead ends: 943 [2019-11-07 01:04:54,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:04:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-07 01:04:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2019-11-07 01:04:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-07 01:04:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1387 transitions. [2019-11-07 01:04:54,887 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1387 transitions. Word has length 150 [2019-11-07 01:04:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:54,887 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1387 transitions. [2019-11-07 01:04:54,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1387 transitions. [2019-11-07 01:04:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:04:54,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:54,891 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:04:54,891 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-11-07 01:04:54,892 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:54,892 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604422673] [2019-11-07 01:04:54,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:55,069 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604422673] [2019-11-07 01:04:55,070 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:55,070 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:55,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903263300] [2019-11-07 01:04:55,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:55,072 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:55,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:55,072 INFO L87 Difference]: Start difference. First operand 943 states and 1387 transitions. Second operand 3 states. [2019-11-07 01:04:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:55,240 INFO L93 Difference]: Finished difference Result 2159 states and 3193 transitions. [2019-11-07 01:04:55,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:55,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-07 01:04:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:55,252 INFO L225 Difference]: With dead ends: 2159 [2019-11-07 01:04:55,252 INFO L226 Difference]: Without dead ends: 1396 [2019-11-07 01:04:55,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-11-07 01:04:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-11-07 01:04:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-11-07 01:04:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2025 transitions. [2019-11-07 01:04:55,411 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2025 transitions. Word has length 150 [2019-11-07 01:04:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:55,412 INFO L462 AbstractCegarLoop]: Abstraction has 1394 states and 2025 transitions. [2019-11-07 01:04:55,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2025 transitions. [2019-11-07 01:04:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:04:55,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:55,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:55,420 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-11-07 01:04:55,421 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:55,421 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112263111] [2019-11-07 01:04:55,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:55,573 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112263111] [2019-11-07 01:04:55,574 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:55,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:55,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943873503] [2019-11-07 01:04:55,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:55,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:55,576 INFO L87 Difference]: Start difference. First operand 1394 states and 2025 transitions. Second operand 3 states. [2019-11-07 01:04:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:56,040 INFO L93 Difference]: Finished difference Result 3707 states and 5443 transitions. [2019-11-07 01:04:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:56,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-07 01:04:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:56,055 INFO L225 Difference]: With dead ends: 3707 [2019-11-07 01:04:56,055 INFO L226 Difference]: Without dead ends: 2595 [2019-11-07 01:04:56,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-11-07 01:04:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-11-07 01:04:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-11-07 01:04:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3764 transitions. [2019-11-07 01:04:56,273 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3764 transitions. Word has length 156 [2019-11-07 01:04:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:56,274 INFO L462 AbstractCegarLoop]: Abstraction has 2593 states and 3764 transitions. [2019-11-07 01:04:56,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3764 transitions. [2019-11-07 01:04:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:04:56,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:56,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:56,280 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-11-07 01:04:56,281 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:56,281 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898754696] [2019-11-07 01:04:56,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:56,500 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898754696] [2019-11-07 01:04:56,501 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:56,501 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:04:56,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936131335] [2019-11-07 01:04:56,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:04:56,502 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:04:56,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:04:56,503 INFO L87 Difference]: Start difference. First operand 2593 states and 3764 transitions. Second operand 6 states. [2019-11-07 01:04:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:57,188 INFO L93 Difference]: Finished difference Result 6395 states and 10006 transitions. [2019-11-07 01:04:57,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:04:57,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-11-07 01:04:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:57,220 INFO L225 Difference]: With dead ends: 6395 [2019-11-07 01:04:57,220 INFO L226 Difference]: Without dead ends: 5489 [2019-11-07 01:04:57,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:04:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2019-11-07 01:04:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5453. [2019-11-07 01:04:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-11-07 01:04:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8364 transitions. [2019-11-07 01:04:57,612 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8364 transitions. Word has length 156 [2019-11-07 01:04:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:57,613 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8364 transitions. [2019-11-07 01:04:57,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:04:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8364 transitions. [2019-11-07 01:04:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:04:57,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:57,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:57,620 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1936499521, now seen corresponding path program 1 times [2019-11-07 01:04:57,620 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:57,620 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098409293] [2019-11-07 01:04:57,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:57,979 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098409293] [2019-11-07 01:04:57,979 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:57,979 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:04:57,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285869962] [2019-11-07 01:04:57,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:04:57,980 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:04:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:04:57,981 INFO L87 Difference]: Start difference. First operand 5453 states and 8364 transitions. Second operand 8 states. [2019-11-07 01:04:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:58,431 INFO L93 Difference]: Finished difference Result 9061 states and 14264 transitions. [2019-11-07 01:04:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:58,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-11-07 01:04:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:58,458 INFO L225 Difference]: With dead ends: 9061 [2019-11-07 01:04:58,458 INFO L226 Difference]: Without dead ends: 5455 [2019-11-07 01:04:58,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:04:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2019-11-07 01:04:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5453. [2019-11-07 01:04:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-11-07 01:04:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8328 transitions. [2019-11-07 01:04:59,017 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8328 transitions. Word has length 156 [2019-11-07 01:04:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:59,018 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8328 transitions. [2019-11-07 01:04:59,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:04:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8328 transitions. [2019-11-07 01:04:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:04:59,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:59,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:04:59,027 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-11-07 01:04:59,028 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:59,028 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744460600] [2019-11-07 01:04:59,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:59,282 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744460600] [2019-11-07 01:04:59,283 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:59,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:59,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100699092] [2019-11-07 01:04:59,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:59,285 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:59,286 INFO L87 Difference]: Start difference. First operand 5453 states and 8328 transitions. Second operand 4 states. [2019-11-07 01:04:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:59,851 INFO L93 Difference]: Finished difference Result 14216 states and 21721 transitions. [2019-11-07 01:04:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:59,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-07 01:04:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:59,893 INFO L225 Difference]: With dead ends: 14216 [2019-11-07 01:04:59,893 INFO L226 Difference]: Without dead ends: 8786 [2019-11-07 01:04:59,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:04:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2019-11-07 01:05:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8784. [2019-11-07 01:05:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8784 states. [2019-11-07 01:05:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 13279 transitions. [2019-11-07 01:05:00,509 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 13279 transitions. Word has length 156 [2019-11-07 01:05:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:00,510 INFO L462 AbstractCegarLoop]: Abstraction has 8784 states and 13279 transitions. [2019-11-07 01:05:00,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 13279 transitions. [2019-11-07 01:05:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:05:00,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:00,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:00,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-11-07 01:05:00,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:00,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764080587] [2019-11-07 01:05:00,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:00,624 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,624 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764080587] [2019-11-07 01:05:00,624 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:00,625 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:00,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481228230] [2019-11-07 01:05:00,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:00,626 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:00,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:00,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:00,626 INFO L87 Difference]: Start difference. First operand 8784 states and 13279 transitions. Second operand 3 states. [2019-11-07 01:05:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:01,502 INFO L93 Difference]: Finished difference Result 25169 states and 38128 transitions. [2019-11-07 01:05:01,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:01,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-07 01:05:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:01,546 INFO L225 Difference]: With dead ends: 25169 [2019-11-07 01:05:01,546 INFO L226 Difference]: Without dead ends: 16843 [2019-11-07 01:05:01,564 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,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-11-07 01:05:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 16841. [2019-11-07 01:05:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-11-07 01:05:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 25210 transitions. [2019-11-07 01:05:02,649 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 25210 transitions. Word has length 158 [2019-11-07 01:05:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:02,649 INFO L462 AbstractCegarLoop]: Abstraction has 16841 states and 25210 transitions. [2019-11-07 01:05:02,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 25210 transitions. [2019-11-07 01:05:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 01:05:02,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:02,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:02,664 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 725817844, now seen corresponding path program 1 times [2019-11-07 01:05:02,664 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:02,665 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246856032] [2019-11-07 01:05:02,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:02,817 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,818 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246856032] [2019-11-07 01:05:02,818 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:02,818 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:02,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564731584] [2019-11-07 01:05:02,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:02,819 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:02,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:02,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:02,820 INFO L87 Difference]: Start difference. First operand 16841 states and 25210 transitions. Second operand 4 states. [2019-11-07 01:05:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:04,084 INFO L93 Difference]: Finished difference Result 26903 states and 40236 transitions. [2019-11-07 01:05:04,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:04,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-07 01:05:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:04,117 INFO L225 Difference]: With dead ends: 26903 [2019-11-07 01:05:04,117 INFO L226 Difference]: Without dead ends: 13712 [2019-11-07 01:05:04,139 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:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-11-07 01:05:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 13712. [2019-11-07 01:05:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13712 states. [2019-11-07 01:05:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 20437 transitions. [2019-11-07 01:05:04,826 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 20437 transitions. Word has length 158 [2019-11-07 01:05:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:04,827 INFO L462 AbstractCegarLoop]: Abstraction has 13712 states and 20437 transitions. [2019-11-07 01:05:04,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 20437 transitions. [2019-11-07 01:05:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-07 01:05:04,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:04,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:04,846 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-11-07 01:05:04,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:04,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894842555] [2019-11-07 01:05:04,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:05,193 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:05,194 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894842555] [2019-11-07 01:05:05,194 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:05,194 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:05,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785317899] [2019-11-07 01:05:05,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:05,196 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:05,197 INFO L87 Difference]: Start difference. First operand 13712 states and 20437 transitions. Second operand 4 states. [2019-11-07 01:05:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:06,609 INFO L93 Difference]: Finished difference Result 40158 states and 59777 transitions. [2019-11-07 01:05:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:06,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-07 01:05:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:06,684 INFO L225 Difference]: With dead ends: 40158 [2019-11-07 01:05:06,685 INFO L226 Difference]: Without dead ends: 26489 [2019-11-07 01:05:06,712 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:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26489 states. [2019-11-07 01:05:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26489 to 26487. [2019-11-07 01:05:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26487 states. [2019-11-07 01:05:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 39050 transitions. [2019-11-07 01:05:07,986 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 39050 transitions. Word has length 164 [2019-11-07 01:05:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:07,986 INFO L462 AbstractCegarLoop]: Abstraction has 26487 states and 39050 transitions. [2019-11-07 01:05:07,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 39050 transitions. [2019-11-07 01:05:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-07 01:05:08,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:08,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:08,002 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1599816613, now seen corresponding path program 1 times [2019-11-07 01:05:08,003 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:08,003 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009981311] [2019-11-07 01:05:08,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:08,062 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,062 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009981311] [2019-11-07 01:05:08,062 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:08,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:08,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492135774] [2019-11-07 01:05:08,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:08,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:08,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:08,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:08,064 INFO L87 Difference]: Start difference. First operand 26487 states and 39050 transitions. Second operand 3 states. [2019-11-07 01:05:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:10,355 INFO L93 Difference]: Finished difference Result 79261 states and 116893 transitions. [2019-11-07 01:05:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:10,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-07 01:05:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:10,508 INFO L225 Difference]: With dead ends: 79261 [2019-11-07 01:05:10,508 INFO L226 Difference]: Without dead ends: 52883 [2019-11-07 01:05:10,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52883 states. [2019-11-07 01:05:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52883 to 26493. [2019-11-07 01:05:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26493 states. [2019-11-07 01:05:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 39056 transitions. [2019-11-07 01:05:12,005 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 39056 transitions. Word has length 165 [2019-11-07 01:05:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:12,005 INFO L462 AbstractCegarLoop]: Abstraction has 26493 states and 39056 transitions. [2019-11-07 01:05:12,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 39056 transitions. [2019-11-07 01:05:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:05:12,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:12,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:12,021 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1477917308, now seen corresponding path program 1 times [2019-11-07 01:05:12,022 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:12,022 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949176094] [2019-11-07 01:05:12,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:12,115 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,115 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949176094] [2019-11-07 01:05:12,116 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:12,116 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:12,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257527444] [2019-11-07 01:05:12,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:12,117 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:12,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:12,117 INFO L87 Difference]: Start difference. First operand 26493 states and 39056 transitions. Second operand 3 states. [2019-11-07 01:05:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:14,543 INFO L93 Difference]: Finished difference Result 76746 states and 113125 transitions. [2019-11-07 01:05:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:14,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-07 01:05:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:14,705 INFO L225 Difference]: With dead ends: 76746 [2019-11-07 01:05:14,706 INFO L226 Difference]: Without dead ends: 51200 [2019-11-07 01:05:14,758 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:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51200 states. [2019-11-07 01:05:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51200 to 51198. [2019-11-07 01:05:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51198 states. [2019-11-07 01:05:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51198 states to 51198 states and 74563 transitions. [2019-11-07 01:05:18,160 INFO L78 Accepts]: Start accepts. Automaton has 51198 states and 74563 transitions. Word has length 166 [2019-11-07 01:05:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:18,161 INFO L462 AbstractCegarLoop]: Abstraction has 51198 states and 74563 transitions. [2019-11-07 01:05:18,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 51198 states and 74563 transitions. [2019-11-07 01:05:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:05:18,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:18,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:18,187 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash 561013721, now seen corresponding path program 1 times [2019-11-07 01:05:18,188 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:18,188 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355492781] [2019-11-07 01:05:18,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:18,337 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:18,338 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355492781] [2019-11-07 01:05:18,338 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:18,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:18,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343825254] [2019-11-07 01:05:18,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:18,339 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:18,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:18,340 INFO L87 Difference]: Start difference. First operand 51198 states and 74563 transitions. Second operand 4 states. [2019-11-07 01:05:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:20,330 INFO L93 Difference]: Finished difference Result 89658 states and 130557 transitions. [2019-11-07 01:05:20,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:20,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-07 01:05:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:20,418 INFO L225 Difference]: With dead ends: 89658 [2019-11-07 01:05:20,419 INFO L226 Difference]: Without dead ends: 39289 [2019-11-07 01:05:20,462 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:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39289 states.