/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:40,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:41,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:41,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:41,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:41,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:41,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:41,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:41,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:41,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:41,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:41,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:41,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:41,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:41,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:41,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:41,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:41,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:41,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:41,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:41,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:41,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:41,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:41,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:41,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:41,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:41,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:41,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:41,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:41,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:41,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:41,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:41,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:41,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:41,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:41,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:41,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:41,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:41,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:41,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:41,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:41,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:06:41,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:41,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:41,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:41,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:41,066 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:41,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:41,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:41,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:41,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:41,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:41,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:41,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:41,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:41,068 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:41,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:41,069 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:41,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:41,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:41,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:41,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:41,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:41,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:41,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:41,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:41,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:41,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:41,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:41,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:41,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:06:41,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:41,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:41,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:41,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:41,392 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:41,392 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:06:41,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb0563e8/04af6059a53c4db0a027d330aaf54e82/FLAG8fea4495b [2019-11-07 01:06:42,034 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:42,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:06:42,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb0563e8/04af6059a53c4db0a027d330aaf54e82/FLAG8fea4495b [2019-11-07 01:06:42,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb0563e8/04af6059a53c4db0a027d330aaf54e82 [2019-11-07 01:06:42,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:42,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:42,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:42,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:42,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:42,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:42" (1/1) ... [2019-11-07 01:06:42,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433d9a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:42, skipping insertion in model container [2019-11-07 01:06:42,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:42" (1/1) ... [2019-11-07 01:06:42,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:42,548 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:43,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:43,385 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:43,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:43,864 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:43,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43 WrapperNode [2019-11-07 01:06:43,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:43,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:43,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:43,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:43,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... [2019-11-07 01:06:43,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... [2019-11-07 01:06:43,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... [2019-11-07 01:06:43,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... [2019-11-07 01:06:43,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... [2019-11-07 01:06:43,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... [2019-11-07 01:06:43,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... [2019-11-07 01:06:43,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:43,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:43,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:43,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:43,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:44,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:44,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:45,733 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:45,734 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:45,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:45 BoogieIcfgContainer [2019-11-07 01:06:45,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:45,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:45,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:45,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:45,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:42" (1/3) ... [2019-11-07 01:06:45,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6065351d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:45, skipping insertion in model container [2019-11-07 01:06:45,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:43" (2/3) ... [2019-11-07 01:06:45,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6065351d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:45, skipping insertion in model container [2019-11-07 01:06:45,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:45" (3/3) ... [2019-11-07 01:06:45,743 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:06:45,754 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:45,763 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:06:45,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:06:45,804 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:45,804 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:45,804 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:45,804 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:45,804 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:45,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:45,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:45,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states. [2019-11-07 01:06:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:06:45,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:45,856 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:06:45,858 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:45,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash 18427047, now seen corresponding path program 1 times [2019-11-07 01:06:45,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:45,875 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628141403] [2019-11-07 01:06:45,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:46,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628141403] [2019-11-07 01:06:46,596 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:46,596 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:46,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582064287] [2019-11-07 01:06:46,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:46,608 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:46,626 INFO L87 Difference]: Start difference. First operand 405 states. Second operand 3 states. [2019-11-07 01:06:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:46,887 INFO L93 Difference]: Finished difference Result 734 states and 1290 transitions. [2019-11-07 01:06:46,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:46,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-07 01:06:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:46,909 INFO L225 Difference]: With dead ends: 734 [2019-11-07 01:06:46,910 INFO L226 Difference]: Without dead ends: 573 [2019-11-07 01:06:46,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-07 01:06:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2019-11-07 01:06:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-07 01:06:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 834 transitions. [2019-11-07 01:06:47,070 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 834 transitions. Word has length 149 [2019-11-07 01:06:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:47,072 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 834 transitions. [2019-11-07 01:06:47,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 834 transitions. [2019-11-07 01:06:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:06:47,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:47,084 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:06:47,084 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash 108834247, now seen corresponding path program 1 times [2019-11-07 01:06:47,085 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:47,085 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712959180] [2019-11-07 01:06:47,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:47,319 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712959180] [2019-11-07 01:06:47,319 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:47,319 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:47,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58301500] [2019-11-07 01:06:47,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:47,323 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:47,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:47,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:47,325 INFO L87 Difference]: Start difference. First operand 571 states and 834 transitions. Second operand 3 states. [2019-11-07 01:06:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:47,568 INFO L93 Difference]: Finished difference Result 1144 states and 1727 transitions. [2019-11-07 01:06:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:47,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-07 01:06:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:47,577 INFO L225 Difference]: With dead ends: 1144 [2019-11-07 01:06:47,577 INFO L226 Difference]: Without dead ends: 915 [2019-11-07 01:06:47,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-11-07 01:06:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-11-07 01:06:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-11-07 01:06:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1356 transitions. [2019-11-07 01:06:47,620 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1356 transitions. Word has length 149 [2019-11-07 01:06:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:47,621 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1356 transitions. [2019-11-07 01:06:47,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1356 transitions. [2019-11-07 01:06:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 01:06:47,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:47,624 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:06:47,624 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:47,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1956442329, now seen corresponding path program 1 times [2019-11-07 01:06:47,625 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:47,625 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123299164] [2019-11-07 01:06:47,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:48,138 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123299164] [2019-11-07 01:06:48,139 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:48,139 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:48,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600534648] [2019-11-07 01:06:48,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:48,143 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:48,144 INFO L87 Difference]: Start difference. First operand 913 states and 1356 transitions. Second operand 4 states. [2019-11-07 01:06:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:48,353 INFO L93 Difference]: Finished difference Result 2677 states and 3967 transitions. [2019-11-07 01:06:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:48,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-07 01:06:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:48,369 INFO L225 Difference]: With dead ends: 2677 [2019-11-07 01:06:48,369 INFO L226 Difference]: Without dead ends: 1777 [2019-11-07 01:06:48,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-11-07 01:06:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1748. [2019-11-07 01:06:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2019-11-07 01:06:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2584 transitions. [2019-11-07 01:06:48,503 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2584 transitions. Word has length 149 [2019-11-07 01:06:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:48,503 INFO L462 AbstractCegarLoop]: Abstraction has 1748 states and 2584 transitions. [2019-11-07 01:06:48,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2584 transitions. [2019-11-07 01:06:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:06:48,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:48,508 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:06:48,508 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:48,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:48,509 INFO L82 PathProgramCache]: Analyzing trace with hash 970634365, now seen corresponding path program 1 times [2019-11-07 01:06:48,510 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:48,510 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592369173] [2019-11-07 01:06:48,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:48,584 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592369173] [2019-11-07 01:06:48,584 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:48,584 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:48,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209915738] [2019-11-07 01:06:48,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:48,585 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:48,586 INFO L87 Difference]: Start difference. First operand 1748 states and 2584 transitions. Second operand 3 states. [2019-11-07 01:06:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:48,735 INFO L93 Difference]: Finished difference Result 5198 states and 7682 transitions. [2019-11-07 01:06:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:48,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-07 01:06:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:48,757 INFO L225 Difference]: With dead ends: 5198 [2019-11-07 01:06:48,758 INFO L226 Difference]: Without dead ends: 3482 [2019-11-07 01:06:48,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2019-11-07 01:06:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 1750. [2019-11-07 01:06:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-11-07 01:06:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2586 transitions. [2019-11-07 01:06:48,880 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2586 transitions. Word has length 150 [2019-11-07 01:06:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:48,880 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 2586 transitions. [2019-11-07 01:06:48,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2586 transitions. [2019-11-07 01:06:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:06:48,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:48,884 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:06:48,885 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1963532230, now seen corresponding path program 1 times [2019-11-07 01:06:48,885 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:48,886 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319010816] [2019-11-07 01:06:48,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:49,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319010816] [2019-11-07 01:06:49,134 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:49,134 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:49,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146334457] [2019-11-07 01:06:49,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:49,135 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:49,136 INFO L87 Difference]: Start difference. First operand 1750 states and 2586 transitions. Second operand 4 states. [2019-11-07 01:06:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:49,249 INFO L93 Difference]: Finished difference Result 3482 states and 5147 transitions. [2019-11-07 01:06:49,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:49,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-07 01:06:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:49,259 INFO L225 Difference]: With dead ends: 3482 [2019-11-07 01:06:49,259 INFO L226 Difference]: Without dead ends: 1750 [2019-11-07 01:06:49,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-11-07 01:06:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1749. [2019-11-07 01:06:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-11-07 01:06:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2583 transitions. [2019-11-07 01:06:49,354 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2583 transitions. Word has length 151 [2019-11-07 01:06:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:49,354 INFO L462 AbstractCegarLoop]: Abstraction has 1749 states and 2583 transitions. [2019-11-07 01:06:49,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2583 transitions. [2019-11-07 01:06:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:06:49,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:49,359 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:06:49,360 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:49,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:49,360 INFO L82 PathProgramCache]: Analyzing trace with hash 858257964, now seen corresponding path program 1 times [2019-11-07 01:06:49,360 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:49,361 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524626291] [2019-11-07 01:06:49,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:49,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524626291] [2019-11-07 01:06:49,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:49,470 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:49,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357228925] [2019-11-07 01:06:49,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:49,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:49,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:49,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:49,471 INFO L87 Difference]: Start difference. First operand 1749 states and 2583 transitions. Second operand 3 states. [2019-11-07 01:06:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:49,653 INFO L93 Difference]: Finished difference Result 4577 states and 6755 transitions. [2019-11-07 01:06:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:49,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-07 01:06:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:49,670 INFO L225 Difference]: With dead ends: 4577 [2019-11-07 01:06:49,670 INFO L226 Difference]: Without dead ends: 3026 [2019-11-07 01:06:49,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2019-11-07 01:06:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2997. [2019-11-07 01:06:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2997 states. [2019-11-07 01:06:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 4373 transitions. [2019-11-07 01:06:49,953 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 4373 transitions. Word has length 151 [2019-11-07 01:06:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:49,953 INFO L462 AbstractCegarLoop]: Abstraction has 2997 states and 4373 transitions. [2019-11-07 01:06:49,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 4373 transitions. [2019-11-07 01:06:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:06:49,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:49,960 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:06:49,961 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -649393937, now seen corresponding path program 1 times [2019-11-07 01:06:49,962 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:49,962 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244860591] [2019-11-07 01:06:49,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:50,195 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244860591] [2019-11-07 01:06:50,195 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:50,195 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:50,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370164063] [2019-11-07 01:06:50,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:50,196 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:50,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:50,198 INFO L87 Difference]: Start difference. First operand 2997 states and 4373 transitions. Second operand 4 states. [2019-11-07 01:06:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:50,354 INFO L93 Difference]: Finished difference Result 5374 states and 7862 transitions. [2019-11-07 01:06:50,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:50,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-07 01:06:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:50,369 INFO L225 Difference]: With dead ends: 5374 [2019-11-07 01:06:50,369 INFO L226 Difference]: Without dead ends: 2563 [2019-11-07 01:06:50,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2019-11-07 01:06:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2563. [2019-11-07 01:06:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-11-07 01:06:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3737 transitions. [2019-11-07 01:06:50,510 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3737 transitions. Word has length 151 [2019-11-07 01:06:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:50,511 INFO L462 AbstractCegarLoop]: Abstraction has 2563 states and 3737 transitions. [2019-11-07 01:06:50,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3737 transitions. [2019-11-07 01:06:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:06:50,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:50,518 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:06:50,518 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash -341408988, now seen corresponding path program 1 times [2019-11-07 01:06:50,519 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:50,519 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217521918] [2019-11-07 01:06:50,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:50,609 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217521918] [2019-11-07 01:06:50,609 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:50,609 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:50,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726688033] [2019-11-07 01:06:50,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:50,610 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:50,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:50,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:50,611 INFO L87 Difference]: Start difference. First operand 2563 states and 3737 transitions. Second operand 3 states. [2019-11-07 01:06:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:50,866 INFO L93 Difference]: Finished difference Result 5831 states and 8728 transitions. [2019-11-07 01:06:50,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:50,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-07 01:06:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:50,884 INFO L225 Difference]: With dead ends: 5831 [2019-11-07 01:06:50,884 INFO L226 Difference]: Without dead ends: 3457 [2019-11-07 01:06:50,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-11-07 01:06:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3395. [2019-11-07 01:06:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2019-11-07 01:06:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 5094 transitions. [2019-11-07 01:06:51,072 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 5094 transitions. Word has length 152 [2019-11-07 01:06:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:51,073 INFO L462 AbstractCegarLoop]: Abstraction has 3395 states and 5094 transitions. [2019-11-07 01:06:51,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 5094 transitions. [2019-11-07 01:06:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:06:51,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:51,078 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] [2019-11-07 01:06:51,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:51,079 INFO L82 PathProgramCache]: Analyzing trace with hash 35518099, now seen corresponding path program 1 times [2019-11-07 01:06:51,079 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:51,079 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665585107] [2019-11-07 01:06:51,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:51,464 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665585107] [2019-11-07 01:06:51,464 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:51,464 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 01:06:51,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478287563] [2019-11-07 01:06:51,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 01:06:51,465 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:51,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 01:06:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-07 01:06:51,466 INFO L87 Difference]: Start difference. First operand 3395 states and 5094 transitions. Second operand 13 states. [2019-11-07 01:06:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:55,974 INFO L93 Difference]: Finished difference Result 16024 states and 24982 transitions. [2019-11-07 01:06:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-07 01:06:55,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2019-11-07 01:06:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:56,041 INFO L225 Difference]: With dead ends: 16024 [2019-11-07 01:06:56,041 INFO L226 Difference]: Without dead ends: 12851 [2019-11-07 01:06:56,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-11-07 01:06:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12851 states. [2019-11-07 01:06:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12851 to 7992. [2019-11-07 01:06:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7992 states. [2019-11-07 01:06:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7992 states to 7992 states and 12283 transitions. [2019-11-07 01:06:56,625 INFO L78 Accepts]: Start accepts. Automaton has 7992 states and 12283 transitions. Word has length 155 [2019-11-07 01:06:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:56,626 INFO L462 AbstractCegarLoop]: Abstraction has 7992 states and 12283 transitions. [2019-11-07 01:06:56,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 01:06:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7992 states and 12283 transitions. [2019-11-07 01:06:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:06:56,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:56,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:56,636 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:56,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:56,636 INFO L82 PathProgramCache]: Analyzing trace with hash -616025582, now seen corresponding path program 1 times [2019-11-07 01:06:56,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:56,637 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285597360] [2019-11-07 01:06:56,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:56,848 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285597360] [2019-11-07 01:06:56,848 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:56,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:56,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535998477] [2019-11-07 01:06:56,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:56,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:56,851 INFO L87 Difference]: Start difference. First operand 7992 states and 12283 transitions. Second operand 5 states. [2019-11-07 01:06:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:57,390 INFO L93 Difference]: Finished difference Result 11513 states and 17844 transitions. [2019-11-07 01:06:57,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:57,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-11-07 01:06:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:57,401 INFO L225 Difference]: With dead ends: 11513 [2019-11-07 01:06:57,401 INFO L226 Difference]: Without dead ends: 4406 [2019-11-07 01:06:57,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:06:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2019-11-07 01:06:57,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 3395. [2019-11-07 01:06:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2019-11-07 01:06:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 5079 transitions. [2019-11-07 01:06:57,591 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 5079 transitions. Word has length 155 [2019-11-07 01:06:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:57,592 INFO L462 AbstractCegarLoop]: Abstraction has 3395 states and 5079 transitions. [2019-11-07 01:06:57,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 5079 transitions. [2019-11-07 01:06:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:06:57,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:57,596 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] [2019-11-07 01:06:57,597 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:57,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash 917941838, now seen corresponding path program 1 times [2019-11-07 01:06:57,598 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:57,598 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108126543] [2019-11-07 01:06:57,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:57,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108126543] [2019-11-07 01:06:57,799 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:57,799 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:06:57,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332316603] [2019-11-07 01:06:57,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:06:57,800 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:57,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:06:57,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:57,801 INFO L87 Difference]: Start difference. First operand 3395 states and 5079 transitions. Second operand 9 states. [2019-11-07 01:06:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:59,374 INFO L93 Difference]: Finished difference Result 13649 states and 21233 transitions. [2019-11-07 01:06:59,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 01:06:59,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-11-07 01:06:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:59,405 INFO L225 Difference]: With dead ends: 13649 [2019-11-07 01:06:59,405 INFO L226 Difference]: Without dead ends: 10476 [2019-11-07 01:06:59,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-11-07 01:06:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10476 states. [2019-11-07 01:06:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10476 to 6314. [2019-11-07 01:06:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6314 states. [2019-11-07 01:06:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 9620 transitions. [2019-11-07 01:06:59,907 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 9620 transitions. Word has length 155 [2019-11-07 01:06:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:59,907 INFO L462 AbstractCegarLoop]: Abstraction has 6314 states and 9620 transitions. [2019-11-07 01:06:59,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:06:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 9620 transitions. [2019-11-07 01:06:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:06:59,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:59,913 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] [2019-11-07 01:06:59,913 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 266398157, now seen corresponding path program 1 times [2019-11-07 01:06:59,914 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:59,914 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637639502] [2019-11-07 01:06:59,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:00,090 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637639502] [2019-11-07 01:07:00,090 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:00,090 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:00,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684329805] [2019-11-07 01:07:00,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:00,091 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:00,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:00,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:00,092 INFO L87 Difference]: Start difference. First operand 6314 states and 9620 transitions. Second operand 4 states. [2019-11-07 01:07:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:00,642 INFO L93 Difference]: Finished difference Result 16559 states and 25207 transitions. [2019-11-07 01:07:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:00,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-07 01:07:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:00,663 INFO L225 Difference]: With dead ends: 16559 [2019-11-07 01:07:00,663 INFO L226 Difference]: Without dead ends: 10276 [2019-11-07 01:07:00,673 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:07:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10276 states. [2019-11-07 01:07:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10276 to 10253. [2019-11-07 01:07:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10253 states. [2019-11-07 01:07:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 15452 transitions. [2019-11-07 01:07:01,365 INFO L78 Accepts]: Start accepts. Automaton has 10253 states and 15452 transitions. Word has length 155 [2019-11-07 01:07:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:01,366 INFO L462 AbstractCegarLoop]: Abstraction has 10253 states and 15452 transitions. [2019-11-07 01:07:01,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10253 states and 15452 transitions. [2019-11-07 01:07:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:07:01,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:01,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:01,376 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -800612128, now seen corresponding path program 1 times [2019-11-07 01:07:01,376 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:01,376 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523435898] [2019-11-07 01:07:01,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:01,488 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523435898] [2019-11-07 01:07:01,491 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:01,492 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:01,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842492278] [2019-11-07 01:07:01,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:01,493 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:01,494 INFO L87 Difference]: Start difference. First operand 10253 states and 15452 transitions. Second operand 3 states. [2019-11-07 01:07:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:02,302 INFO L93 Difference]: Finished difference Result 25879 states and 39071 transitions. [2019-11-07 01:07:02,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:02,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-07 01:07:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:02,337 INFO L225 Difference]: With dead ends: 25879 [2019-11-07 01:07:02,337 INFO L226 Difference]: Without dead ends: 16012 [2019-11-07 01:07:02,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2019-11-07 01:07:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 15991. [2019-11-07 01:07:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15991 states. [2019-11-07 01:07:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15991 states to 15991 states and 23833 transitions. [2019-11-07 01:07:03,888 INFO L78 Accepts]: Start accepts. Automaton has 15991 states and 23833 transitions. Word has length 157 [2019-11-07 01:07:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:03,889 INFO L462 AbstractCegarLoop]: Abstraction has 15991 states and 23833 transitions. [2019-11-07 01:07:03,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 15991 states and 23833 transitions. [2019-11-07 01:07:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:07:03,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:03,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:03,910 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash 39936174, now seen corresponding path program 1 times [2019-11-07 01:07:03,911 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:03,911 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612840082] [2019-11-07 01:07:03,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:04,112 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612840082] [2019-11-07 01:07:04,113 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:04,113 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:04,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681955887] [2019-11-07 01:07:04,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:04,114 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:04,114 INFO L87 Difference]: Start difference. First operand 15991 states and 23833 transitions. Second operand 4 states. [2019-11-07 01:07:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:06,439 INFO L93 Difference]: Finished difference Result 46929 states and 69966 transitions. [2019-11-07 01:07:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:06,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-07 01:07:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:06,483 INFO L225 Difference]: With dead ends: 46929 [2019-11-07 01:07:06,484 INFO L226 Difference]: Without dead ends: 30981 [2019-11-07 01:07:06,512 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:07:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30981 states. [2019-11-07 01:07:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30981 to 30940. [2019-11-07 01:07:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30940 states. [2019-11-07 01:07:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30940 states to 30940 states and 45871 transitions. [2019-11-07 01:07:08,331 INFO L78 Accepts]: Start accepts. Automaton has 30940 states and 45871 transitions. Word has length 161 [2019-11-07 01:07:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:08,331 INFO L462 AbstractCegarLoop]: Abstraction has 30940 states and 45871 transitions. [2019-11-07 01:07:08,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30940 states and 45871 transitions. [2019-11-07 01:07:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:07:08,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:08,346 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] [2019-11-07 01:07:08,346 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1035308930, now seen corresponding path program 1 times [2019-11-07 01:07:08,347 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:08,347 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82383984] [2019-11-07 01:07:08,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:08,416 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82383984] [2019-11-07 01:07:08,417 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:08,417 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:08,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928021652] [2019-11-07 01:07:08,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:08,418 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:08,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:08,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:08,418 INFO L87 Difference]: Start difference. First operand 30940 states and 45871 transitions. Second operand 3 states. [2019-11-07 01:07:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:12,115 INFO L93 Difference]: Finished difference Result 92618 states and 137356 transitions. [2019-11-07 01:07:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:12,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-07 01:07:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:12,199 INFO L225 Difference]: With dead ends: 92618 [2019-11-07 01:07:12,200 INFO L226 Difference]: Without dead ends: 61788 [2019-11-07 01:07:12,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61788 states. [2019-11-07 01:07:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61788 to 30946. [2019-11-07 01:07:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30946 states. [2019-11-07 01:07:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30946 states to 30946 states and 45877 transitions. [2019-11-07 01:07:14,165 INFO L78 Accepts]: Start accepts. Automaton has 30946 states and 45877 transitions. Word has length 162 [2019-11-07 01:07:14,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:14,166 INFO L462 AbstractCegarLoop]: Abstraction has 30946 states and 45877 transitions. [2019-11-07 01:07:14,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30946 states and 45877 transitions. [2019-11-07 01:07:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:07:14,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:14,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:14,178 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:14,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1360973299, now seen corresponding path program 1 times [2019-11-07 01:07:14,179 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:14,179 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423411379] [2019-11-07 01:07:14,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:14,314 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423411379] [2019-11-07 01:07:14,314 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:14,314 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:14,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232672888] [2019-11-07 01:07:14,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:14,315 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:14,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:14,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:14,316 INFO L87 Difference]: Start difference. First operand 30946 states and 45877 transitions. Second operand 4 states. [2019-11-07 01:07:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:16,010 INFO L93 Difference]: Finished difference Result 61850 states and 91698 transitions. [2019-11-07 01:07:16,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:16,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-07 01:07:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:16,050 INFO L225 Difference]: With dead ends: 61850 [2019-11-07 01:07:16,050 INFO L226 Difference]: Without dead ends: 30940 [2019-11-07 01:07:16,084 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