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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:02:18,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:02:18,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:02:18,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:02:18,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:02:18,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:02:18,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:02:18,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:02:18,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:02:18,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:02:18,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:02:18,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:02:18,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:02:18,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:02:18,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:02:18,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:02:18,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:02:18,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:02:18,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:02:18,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:02:18,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:02:18,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:02:18,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:02:18,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:02:18,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:02:18,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:02:18,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:02:18,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:02:18,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:02:18,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:02:18,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:02:18,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:02:18,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:02:18,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:02:18,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:02:18,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:02:18,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:02:18,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:02:18,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:02:18,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:02:18,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:02:18,693 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-10-15 03:02:18,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:02:18,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:02:18,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:02:18,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:02:18,719 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:02:18,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:02:18,719 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:02:18,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:02:18,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:02:18,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:02:18,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:02:18,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:02:18,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:02:18,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:02:18,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:02:18,721 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:02:18,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:02:18,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:02:18,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:02:18,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:02:18,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:02:18,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:02:18,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:02:18,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:02:18,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:02:18,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:02:18,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:02:18,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:02:18,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:02:19,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:02:19,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:02:19,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:02:19,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:02:19,110 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:02:19,111 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-15 03:02:19,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8901c0f24/136441f8f79649b2894d4e9a8cdf840c/FLAG5b3611c09 [2019-10-15 03:02:19,942 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:02:19,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-15 03:02:19,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8901c0f24/136441f8f79649b2894d4e9a8cdf840c/FLAG5b3611c09 [2019-10-15 03:02:20,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8901c0f24/136441f8f79649b2894d4e9a8cdf840c [2019-10-15 03:02:20,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:02:20,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:02:20,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:20,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:02:20,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:02:20,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:20" (1/1) ... [2019-10-15 03:02:20,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372c657e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:20, skipping insertion in model container [2019-10-15 03:02:20,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:20" (1/1) ... [2019-10-15 03:02:20,110 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:02:20,235 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:02:21,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:21,244 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:02:21,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:21,565 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:02:21,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21 WrapperNode [2019-10-15 03:02:21,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:21,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:02:21,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:02:21,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:02:21,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:02:21,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:02:21,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:02:21,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:02:21,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (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-10-15 03:02:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:02:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:02:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:02:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:02:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:02:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:02:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:02:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:02:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:02:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:02:24,357 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:02:24,358 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:02:24,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:24 BoogieIcfgContainer [2019-10-15 03:02:24,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:02:24,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:02:24,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:02:24,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:02:24,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:02:20" (1/3) ... [2019-10-15 03:02:24,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2303a6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:24, skipping insertion in model container [2019-10-15 03:02:24,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (2/3) ... [2019-10-15 03:02:24,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2303a6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:24, skipping insertion in model container [2019-10-15 03:02:24,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:24" (3/3) ... [2019-10-15 03:02:24,389 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-10-15 03:02:24,412 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:02:24,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-15 03:02:24,456 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-15 03:02:24,500 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:02:24,500 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:02:24,500 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:02:24,500 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:02:24,501 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:02:24,501 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:02:24,501 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:02:24,501 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:02:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states. [2019-10-15 03:02:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:02:24,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:24,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:24,550 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1158995348, now seen corresponding path program 1 times [2019-10-15 03:02:24,568 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:24,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850058423] [2019-10-15 03:02:24,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:24,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850058423] [2019-10-15 03:02:24,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:24,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:24,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785387601] [2019-10-15 03:02:24,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:24,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:24,875 INFO L87 Difference]: Start difference. First operand 479 states. Second operand 4 states. [2019-10-15 03:02:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:26,755 INFO L93 Difference]: Finished difference Result 489 states and 914 transitions. [2019-10-15 03:02:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:02:26,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:02:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:26,796 INFO L225 Difference]: With dead ends: 489 [2019-10-15 03:02:26,797 INFO L226 Difference]: Without dead ends: 300 [2019-10-15 03:02:26,802 INFO L600 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-10-15 03:02:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-15 03:02:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-10-15 03:02:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-15 03:02:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 363 transitions. [2019-10-15 03:02:26,862 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 363 transitions. Word has length 10 [2019-10-15 03:02:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:26,862 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 363 transitions. [2019-10-15 03:02:26,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 363 transitions. [2019-10-15 03:02:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:02:26,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:26,863 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:26,864 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1569114359, now seen corresponding path program 1 times [2019-10-15 03:02:26,864 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:26,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417438861] [2019-10-15 03:02:26,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:26,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:26,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:26,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417438861] [2019-10-15 03:02:26,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:26,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:26,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144523836] [2019-10-15 03:02:26,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:26,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:26,924 INFO L87 Difference]: Start difference. First operand 300 states and 363 transitions. Second operand 4 states. [2019-10-15 03:02:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:27,394 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2019-10-15 03:02:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:02:27,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:02:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:27,399 INFO L225 Difference]: With dead ends: 300 [2019-10-15 03:02:27,399 INFO L226 Difference]: Without dead ends: 295 [2019-10-15 03:02:27,400 INFO L600 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-10-15 03:02:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-15 03:02:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-15 03:02:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-15 03:02:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2019-10-15 03:02:27,433 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 11 [2019-10-15 03:02:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:27,434 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2019-10-15 03:02:27,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2019-10-15 03:02:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-15 03:02:27,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:27,443 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:27,444 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash 523116136, now seen corresponding path program 1 times [2019-10-15 03:02:27,444 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:27,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963766274] [2019-10-15 03:02:27,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:27,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:27,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:30,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963766274] [2019-10-15 03:02:30,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:30,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-15 03:02:30,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813724677] [2019-10-15 03:02:30,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-15 03:02:30,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-15 03:02:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-10-15 03:02:30,628 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand 63 states. [2019-10-15 03:02:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:33,042 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2019-10-15 03:02:33,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-15 03:02:33,043 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 247 [2019-10-15 03:02:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:33,047 INFO L225 Difference]: With dead ends: 296 [2019-10-15 03:02:33,048 INFO L226 Difference]: Without dead ends: 294 [2019-10-15 03:02:33,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-10-15 03:02:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-15 03:02:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-10-15 03:02:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-15 03:02:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-10-15 03:02:33,061 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 247 [2019-10-15 03:02:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:33,063 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-10-15 03:02:33,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-15 03:02:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-10-15 03:02:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-15 03:02:33,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:33,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:33,069 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash -963264135, now seen corresponding path program 1 times [2019-10-15 03:02:33,069 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:33,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454808022] [2019-10-15 03:02:33,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:33,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:33,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:34,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454808022] [2019-10-15 03:02:34,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:34,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:34,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239948244] [2019-10-15 03:02:34,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:34,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:34,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:34,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:34,656 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 5 states. [2019-10-15 03:02:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:35,367 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-10-15 03:02:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:35,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-10-15 03:02:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:35,373 INFO L225 Difference]: With dead ends: 295 [2019-10-15 03:02:35,373 INFO L226 Difference]: Without dead ends: 293 [2019-10-15 03:02:35,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 176 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-15 03:02:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2019-10-15 03:02:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-15 03:02:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2019-10-15 03:02:35,387 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 248 [2019-10-15 03:02:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:35,388 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2019-10-15 03:02:35,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2019-10-15 03:02:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-15 03:02:35,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:35,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:35,394 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1920569647, now seen corresponding path program 1 times [2019-10-15 03:02:35,395 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:35,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288891197] [2019-10-15 03:02:35,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:35,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:35,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:38,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288891197] [2019-10-15 03:02:38,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:38,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-15 03:02:38,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678177585] [2019-10-15 03:02:38,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-15 03:02:38,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:38,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-15 03:02:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-15 03:02:38,109 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 65 states. [2019-10-15 03:02:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:39,991 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-10-15 03:02:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-15 03:02:39,992 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 251 [2019-10-15 03:02:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:39,995 INFO L225 Difference]: With dead ends: 294 [2019-10-15 03:02:39,995 INFO L226 Difference]: Without dead ends: 292 [2019-10-15 03:02:39,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 03:02:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-15 03:02:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-10-15 03:02:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-15 03:02:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2019-10-15 03:02:40,006 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 251 [2019-10-15 03:02:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:40,007 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2019-10-15 03:02:40,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-15 03:02:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2019-10-15 03:02:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-15 03:02:40,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:40,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:40,012 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash 591887940, now seen corresponding path program 1 times [2019-10-15 03:02:40,013 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:40,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199052893] [2019-10-15 03:02:40,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:40,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:40,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:41,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199052893] [2019-10-15 03:02:41,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:41,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:41,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661227275] [2019-10-15 03:02:41,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:41,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:41,904 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand 5 states. [2019-10-15 03:02:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:42,472 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-10-15 03:02:42,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:42,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2019-10-15 03:02:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:42,476 INFO L225 Difference]: With dead ends: 289 [2019-10-15 03:02:42,476 INFO L226 Difference]: Without dead ends: 287 [2019-10-15 03:02:42,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 3 SyntacticMatches, 179 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-15 03:02:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-10-15 03:02:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-15 03:02:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2019-10-15 03:02:42,484 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 252 [2019-10-15 03:02:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:42,485 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2019-10-15 03:02:42,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2019-10-15 03:02:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-15 03:02:42,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:42,489 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:42,489 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:42,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:42,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1868780776, now seen corresponding path program 1 times [2019-10-15 03:02:42,490 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:42,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692206426] [2019-10-15 03:02:42,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:45,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692206426] [2019-10-15 03:02:45,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:45,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-15 03:02:45,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263089538] [2019-10-15 03:02:45,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-15 03:02:45,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:45,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-15 03:02:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 03:02:45,220 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand 66 states. [2019-10-15 03:02:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:46,707 INFO L93 Difference]: Finished difference Result 297 states and 301 transitions. [2019-10-15 03:02:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-15 03:02:46,707 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 254 [2019-10-15 03:02:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:46,710 INFO L225 Difference]: With dead ends: 297 [2019-10-15 03:02:46,710 INFO L226 Difference]: Without dead ends: 295 [2019-10-15 03:02:46,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-15 03:02:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-15 03:02:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 285. [2019-10-15 03:02:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-15 03:02:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2019-10-15 03:02:46,728 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 254 [2019-10-15 03:02:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:46,729 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2019-10-15 03:02:46,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-15 03:02:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2019-10-15 03:02:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-15 03:02:46,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:46,733 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:46,734 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:46,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2097634077, now seen corresponding path program 1 times [2019-10-15 03:02:46,735 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:46,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280938922] [2019-10-15 03:02:46,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:46,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:46,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:46,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280938922] [2019-10-15 03:02:46,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:46,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:46,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914185490] [2019-10-15 03:02:46,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:46,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:46,993 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand 4 states. [2019-10-15 03:02:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:47,462 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2019-10-15 03:02:47,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:02:47,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-10-15 03:02:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:47,466 INFO L225 Difference]: With dead ends: 285 [2019-10-15 03:02:47,466 INFO L226 Difference]: Without dead ends: 281 [2019-10-15 03:02:47,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10-15 03:02:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-15 03:02:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-10-15 03:02:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-15 03:02:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2019-10-15 03:02:47,479 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 255 [2019-10-15 03:02:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:47,480 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2019-10-15 03:02:47,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2019-10-15 03:02:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-15 03:02:47,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:47,484 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:47,485 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:47,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash 616955961, now seen corresponding path program 1 times [2019-10-15 03:02:47,486 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:47,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468672241] [2019-10-15 03:02:47,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:47,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:47,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:50,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468672241] [2019-10-15 03:02:50,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:50,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-15 03:02:50,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713817169] [2019-10-15 03:02:50,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-15 03:02:50,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-15 03:02:50,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 03:02:50,336 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand 66 states. [2019-10-15 03:02:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:51,697 INFO L93 Difference]: Finished difference Result 291 states and 295 transitions. [2019-10-15 03:02:51,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-15 03:02:51,699 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-10-15 03:02:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:51,701 INFO L225 Difference]: With dead ends: 291 [2019-10-15 03:02:51,702 INFO L226 Difference]: Without dead ends: 289 [2019-10-15 03:02:51,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-15 03:02:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-15 03:02:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2019-10-15 03:02:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-15 03:02:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2019-10-15 03:02:51,711 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 256 [2019-10-15 03:02:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:51,712 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2019-10-15 03:02:51,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-15 03:02:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2019-10-15 03:02:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-15 03:02:51,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:51,714 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:51,715 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash 615416761, now seen corresponding path program 1 times [2019-10-15 03:02:51,717 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:51,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66425690] [2019-10-15 03:02:51,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:51,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:51,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:54,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66425690] [2019-10-15 03:02:54,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:54,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-15 03:02:54,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961659717] [2019-10-15 03:02:54,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-15 03:02:54,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:54,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-15 03:02:54,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-15 03:02:54,307 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand 65 states. [2019-10-15 03:02:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:55,686 INFO L93 Difference]: Finished difference Result 297 states and 302 transitions. [2019-10-15 03:02:55,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-15 03:02:55,687 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2019-10-15 03:02:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:55,691 INFO L225 Difference]: With dead ends: 297 [2019-10-15 03:02:55,691 INFO L226 Difference]: Without dead ends: 295 [2019-10-15 03:02:55,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 03:02:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-15 03:02:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 277. [2019-10-15 03:02:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-15 03:02:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2019-10-15 03:02:55,700 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 256 [2019-10-15 03:02:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:55,700 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2019-10-15 03:02:55,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-15 03:02:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2019-10-15 03:02:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-15 03:02:55,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:55,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:55,703 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1946164781, now seen corresponding path program 1 times [2019-10-15 03:02:55,704 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:55,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414270055] [2019-10-15 03:02:55,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:55,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:55,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:58,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414270055] [2019-10-15 03:02:58,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:58,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-15 03:02:58,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478791636] [2019-10-15 03:02:58,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-15 03:02:58,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-15 03:02:58,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-15 03:02:58,241 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand 65 states. [2019-10-15 03:02:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:59,680 INFO L93 Difference]: Finished difference Result 300 states and 305 transitions. [2019-10-15 03:02:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-15 03:02:59,680 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-10-15 03:02:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:59,682 INFO L225 Difference]: With dead ends: 300 [2019-10-15 03:02:59,683 INFO L226 Difference]: Without dead ends: 298 [2019-10-15 03:02:59,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 03:02:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-15 03:02:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2019-10-15 03:02:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-15 03:02:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2019-10-15 03:02:59,692 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 257 [2019-10-15 03:02:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:59,693 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2019-10-15 03:02:59,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-15 03:02:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2019-10-15 03:02:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-15 03:02:59,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:59,695 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:02:59,695 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:59,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1945770546, now seen corresponding path program 1 times [2019-10-15 03:02:59,696 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:59,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624851558] [2019-10-15 03:02:59,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:59,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:59,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat