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-f4eb214f-m [2019-10-13 22:58:41,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:58:41,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:58:41,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:58:41,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:58:41,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:58:41,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:58:41,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:58:41,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:58:41,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:58:41,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:58:41,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:58:41,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:58:41,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:58:41,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:58:41,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:58:41,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:58:41,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:58:41,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:58:41,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:58:41,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:58:41,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:58:41,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:58:41,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:58:41,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:58:41,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:58:41,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:58:41,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:58:41,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:58:41,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:58:41,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:58:41,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:58:41,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:58:41,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:58:41,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:58:41,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:58:41,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:58:41,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:58:41,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:58:41,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:58:41,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:58:41,569 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-13 22:58:41,593 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:58:41,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:58:41,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:58:41,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:58:41,594 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:58:41,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:58:41,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:58:41,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:58:41,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:58:41,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:58:41,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:58:41,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:58:41,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:58:41,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:58:41,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:58:41,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:58:41,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:58:41,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:58:41,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:58:41,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:58:41,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:58:41,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:58:41,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:58:41,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:58:41,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:58:41,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:58:41,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:58:41,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:58:41,600 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-13 22:58:41,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:58:41,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:58:41,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:58:41,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:58:41,887 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:58:41,888 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-13 22:58:41,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91380b75d/f957327ce2e443ae90f1234e2c150ecf/FLAGdbad0a8ec [2019-10-13 22:58:42,627 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:58:42,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-13 22:58:42,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91380b75d/f957327ce2e443ae90f1234e2c150ecf/FLAGdbad0a8ec [2019-10-13 22:58:42,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91380b75d/f957327ce2e443ae90f1234e2c150ecf [2019-10-13 22:58:42,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:58:42,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:58:42,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:42,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:58:42,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:58:42,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:42" (1/1) ... [2019-10-13 22:58:42,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f51fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:42, skipping insertion in model container [2019-10-13 22:58:42,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:42" (1/1) ... [2019-10-13 22:58:42,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:58:42,975 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:58:43,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:43,938 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:58:44,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:44,284 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:58:44,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44 WrapperNode [2019-10-13 22:58:44,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:44,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:58:44,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:58:44,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:58:44,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:58:44,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:58:44,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:58:44,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:58:44,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (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-13 22:58:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:58:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:58:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:58:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:58:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:58:44,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:58:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:58:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:58:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:58:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:58:47,048 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:58:47,048 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 22:58:47,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:47 BoogieIcfgContainer [2019-10-13 22:58:47,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:58:47,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:58:47,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:58:47,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:58:47,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:58:42" (1/3) ... [2019-10-13 22:58:47,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f51c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:47, skipping insertion in model container [2019-10-13 22:58:47,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (2/3) ... [2019-10-13 22:58:47,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f51c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:47, skipping insertion in model container [2019-10-13 22:58:47,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:47" (3/3) ... [2019-10-13 22:58:47,059 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-10-13 22:58:47,069 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:58:47,078 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-13 22:58:47,089 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-13 22:58:47,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:58:47,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:58:47,120 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:58:47,120 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:58:47,120 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:58:47,121 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:58:47,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:58:47,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:58:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states. [2019-10-13 22:58:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 22:58:47,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,158 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,160 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1158995348, now seen corresponding path program 1 times [2019-10-13 22:58:47,175 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769444634] [2019-10-13 22:58:47,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,405 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-13 22:58:47,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769444634] [2019-10-13 22:58:47,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:47,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682388204] [2019-10-13 22:58:47,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:47,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:47,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:47,432 INFO L87 Difference]: Start difference. First operand 479 states. Second operand 4 states. [2019-10-13 22:58:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,670 INFO L93 Difference]: Finished difference Result 489 states and 914 transitions. [2019-10-13 22:58:48,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:48,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-13 22:58:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,688 INFO L225 Difference]: With dead ends: 489 [2019-10-13 22:58:48,689 INFO L226 Difference]: Without dead ends: 300 [2019-10-13 22:58:48,693 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-13 22:58:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-13 22:58:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-10-13 22:58:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-13 22:58:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 363 transitions. [2019-10-13 22:58:48,757 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 363 transitions. Word has length 10 [2019-10-13 22:58:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,758 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 363 transitions. [2019-10-13 22:58:48,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 363 transitions. [2019-10-13 22:58:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:58:48,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,759 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1569114359, now seen corresponding path program 1 times [2019-10-13 22:58:48,761 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657620090] [2019-10-13 22:58:48,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,842 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-13 22:58:48,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657620090] [2019-10-13 22:58:48,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:48,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801562377] [2019-10-13 22:58:48,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:48,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:48,847 INFO L87 Difference]: Start difference. First operand 300 states and 363 transitions. Second operand 4 states. [2019-10-13 22:58:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,208 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2019-10-13 22:58:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:49,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:58:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,213 INFO L225 Difference]: With dead ends: 300 [2019-10-13 22:58:49,213 INFO L226 Difference]: Without dead ends: 295 [2019-10-13 22:58:49,214 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-13 22:58:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-13 22:58:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-13 22:58:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-13 22:58:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2019-10-13 22:58:49,242 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 11 [2019-10-13 22:58:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,242 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2019-10-13 22:58:49,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2019-10-13 22:58:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-13 22:58:49,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,251 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-13 22:58:49,251 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash 523116136, now seen corresponding path program 1 times [2019-10-13 22:58:49,252 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446291664] [2019-10-13 22:58:49,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:51,790 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-13 22:58:51,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446291664] [2019-10-13 22:58:51,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:51,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-13 22:58:51,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351579161] [2019-10-13 22:58:51,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-13 22:58:51,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-13 22:58:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-10-13 22:58:51,796 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand 63 states. [2019-10-13 22:58:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:53,268 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2019-10-13 22:58:53,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-13 22:58:53,269 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 247 [2019-10-13 22:58:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:53,273 INFO L225 Difference]: With dead ends: 296 [2019-10-13 22:58:53,273 INFO L226 Difference]: Without dead ends: 294 [2019-10-13 22:58:53,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 22:58:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-13 22:58:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-10-13 22:58:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-13 22:58:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-10-13 22:58:53,287 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 247 [2019-10-13 22:58:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:53,288 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-10-13 22:58:53,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-13 22:58:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-10-13 22:58:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-13 22:58:53,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:53,294 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-13 22:58:53,294 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash -963264135, now seen corresponding path program 1 times [2019-10-13 22:58:53,295 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:53,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554549074] [2019-10-13 22:58:53,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:53,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:53,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:54,709 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-13 22:58:54,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554549074] [2019-10-13 22:58:54,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:54,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:54,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122366362] [2019-10-13 22:58:54,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:54,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:54,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:54,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:54,712 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 5 states. [2019-10-13 22:58:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:55,238 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-10-13 22:58:55,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:55,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-10-13 22:58:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:55,243 INFO L225 Difference]: With dead ends: 295 [2019-10-13 22:58:55,244 INFO L226 Difference]: Without dead ends: 293 [2019-10-13 22:58:55,244 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-13 22:58:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-13 22:58:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2019-10-13 22:58:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-13 22:58:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2019-10-13 22:58:55,254 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 248 [2019-10-13 22:58:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:55,255 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2019-10-13 22:58:55,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2019-10-13 22:58:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-13 22:58:55,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:55,260 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-13 22:58:55,260 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1920569647, now seen corresponding path program 1 times [2019-10-13 22:58:55,261 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:55,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119132419] [2019-10-13 22:58:55,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:55,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:55,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:57,609 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-13 22:58:57,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119132419] [2019-10-13 22:58:57,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:57,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-13 22:58:57,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807861739] [2019-10-13 22:58:57,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-13 22:58:57,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:57,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-13 22:58:57,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 22:58:57,613 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 65 states. [2019-10-13 22:58:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:59,232 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-10-13 22:58:59,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-13 22:58:59,233 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 251 [2019-10-13 22:58:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:59,236 INFO L225 Difference]: With dead ends: 294 [2019-10-13 22:58:59,236 INFO L226 Difference]: Without dead ends: 292 [2019-10-13 22:58:59,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 22:58:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-13 22:58:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-10-13 22:58:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-13 22:58:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2019-10-13 22:58:59,256 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 251 [2019-10-13 22:58:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:59,258 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2019-10-13 22:58:59,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-13 22:58:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2019-10-13 22:58:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-13 22:58:59,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:59,279 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-13 22:58:59,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 591887940, now seen corresponding path program 1 times [2019-10-13 22:58:59,281 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:59,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405340494] [2019-10-13 22:58:59,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:00,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-10-13 22:59:00,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405340494] [2019-10-13 22:59:00,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:00,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:59:00,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279753441] [2019-10-13 22:59:00,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:59:00,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:59:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:59:00,804 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand 5 states. [2019-10-13 22:59:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:01,419 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-10-13 22:59:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:59:01,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2019-10-13 22:59:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:01,422 INFO L225 Difference]: With dead ends: 289 [2019-10-13 22:59:01,422 INFO L226 Difference]: Without dead ends: 287 [2019-10-13 22:59:01,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 3 SyntacticMatches, 179 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:59:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-13 22:59:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-10-13 22:59:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-13 22:59:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2019-10-13 22:59:01,435 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 252 [2019-10-13 22:59:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:01,436 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2019-10-13 22:59:01,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:59:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2019-10-13 22:59:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-13 22:59:01,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:01,440 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-13 22:59:01,448 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:01,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:01,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1868780776, now seen corresponding path program 1 times [2019-10-13 22:59:01,449 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:01,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605706177] [2019-10-13 22:59:01,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:01,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:01,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:03,409 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-13 22:59:03,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605706177] [2019-10-13 22:59:03,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:03,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-13 22:59:03,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982640441] [2019-10-13 22:59:03,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-13 22:59:03,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:03,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-13 22:59:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 22:59:03,412 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand 66 states. [2019-10-13 22:59:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:04,792 INFO L93 Difference]: Finished difference Result 297 states and 301 transitions. [2019-10-13 22:59:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-13 22:59:04,793 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 254 [2019-10-13 22:59:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:04,796 INFO L225 Difference]: With dead ends: 297 [2019-10-13 22:59:04,796 INFO L226 Difference]: Without dead ends: 295 [2019-10-13 22:59:04,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-13 22:59:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-13 22:59:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 285. [2019-10-13 22:59:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-13 22:59:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2019-10-13 22:59:04,806 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 254 [2019-10-13 22:59:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:04,806 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2019-10-13 22:59:04,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-13 22:59:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2019-10-13 22:59:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-13 22:59:04,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:04,808 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-13 22:59:04,809 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2097634077, now seen corresponding path program 1 times [2019-10-13 22:59:04,810 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:04,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24416976] [2019-10-13 22:59:04,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:04,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:04,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:05,108 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-13 22:59:05,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24416976] [2019-10-13 22:59:05,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:05,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:59:05,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608237110] [2019-10-13 22:59:05,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:59:05,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:59:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:59:05,112 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand 4 states. [2019-10-13 22:59:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:05,502 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2019-10-13 22:59:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:59:05,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-10-13 22:59:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:05,506 INFO L225 Difference]: With dead ends: 285 [2019-10-13 22:59:05,506 INFO L226 Difference]: Without dead ends: 281 [2019-10-13 22:59:05,506 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-13 22:59:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-13 22:59:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-10-13 22:59:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-13 22:59:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2019-10-13 22:59:05,515 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 255 [2019-10-13 22:59:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:05,516 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2019-10-13 22:59:05,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:59:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2019-10-13 22:59:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-13 22:59:05,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:05,518 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-13 22:59:05,518 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash 616955961, now seen corresponding path program 1 times [2019-10-13 22:59:05,519 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:05,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949132802] [2019-10-13 22:59:05,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:05,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:05,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:07,653 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-13 22:59:07,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949132802] [2019-10-13 22:59:07,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:07,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-13 22:59:07,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492620155] [2019-10-13 22:59:07,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-13 22:59:07,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:07,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-13 22:59:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 22:59:07,658 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand 66 states. [2019-10-13 22:59:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:08,979 INFO L93 Difference]: Finished difference Result 291 states and 295 transitions. [2019-10-13 22:59:08,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-13 22:59:08,985 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-10-13 22:59:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:08,987 INFO L225 Difference]: With dead ends: 291 [2019-10-13 22:59:08,987 INFO L226 Difference]: Without dead ends: 289 [2019-10-13 22:59:08,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-13 22:59:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-13 22:59:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2019-10-13 22:59:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-13 22:59:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2019-10-13 22:59:08,995 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 256 [2019-10-13 22:59:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:08,996 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2019-10-13 22:59:08,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-13 22:59:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2019-10-13 22:59:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-13 22:59:08,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:08,998 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-13 22:59:08,999 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash 615416761, now seen corresponding path program 1 times [2019-10-13 22:59:08,999 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:08,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242498523] [2019-10-13 22:59:09,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:09,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:09,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:10,941 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-13 22:59:10,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242498523] [2019-10-13 22:59:10,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:10,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-13 22:59:10,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181344142] [2019-10-13 22:59:10,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-13 22:59:10,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-13 22:59:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 22:59:10,945 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand 65 states. [2019-10-13 22:59:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:12,159 INFO L93 Difference]: Finished difference Result 297 states and 302 transitions. [2019-10-13 22:59:12,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-13 22:59:12,159 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2019-10-13 22:59:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:12,162 INFO L225 Difference]: With dead ends: 297 [2019-10-13 22:59:12,163 INFO L226 Difference]: Without dead ends: 295 [2019-10-13 22:59:12,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 22:59:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-13 22:59:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 277. [2019-10-13 22:59:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-13 22:59:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2019-10-13 22:59:12,172 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 256 [2019-10-13 22:59:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:12,173 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2019-10-13 22:59:12,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-13 22:59:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2019-10-13 22:59:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-13 22:59:12,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:12,175 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-13 22:59:12,175 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1946164781, now seen corresponding path program 1 times [2019-10-13 22:59:12,176 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:12,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773392103] [2019-10-13 22:59:12,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:13,878 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-13 22:59:13,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773392103] [2019-10-13 22:59:13,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:13,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-13 22:59:13,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200703932] [2019-10-13 22:59:13,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-13 22:59:13,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-13 22:59:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 22:59:13,881 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand 65 states. [2019-10-13 22:59:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:15,252 INFO L93 Difference]: Finished difference Result 300 states and 305 transitions. [2019-10-13 22:59:15,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-13 22:59:15,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-10-13 22:59:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:15,256 INFO L225 Difference]: With dead ends: 300 [2019-10-13 22:59:15,256 INFO L226 Difference]: Without dead ends: 298 [2019-10-13 22:59:15,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-13 22:59:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-13 22:59:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2019-10-13 22:59:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-13 22:59:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2019-10-13 22:59:15,266 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 257 [2019-10-13 22:59:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:15,267 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2019-10-13 22:59:15,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-13 22:59:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2019-10-13 22:59:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-13 22:59:15,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:15,270 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-13 22:59:15,271 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1945770546, now seen corresponding path program 1 times [2019-10-13 22:59:15,271 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:15,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343371701] [2019-10-13 22:59:15,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:15,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:15,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:16,397 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-13 22:59:16,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343371701] [2019-10-13 22:59:16,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:16,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:59:16,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609099216] [2019-10-13 22:59:16,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:59:16,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:16,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:59:16,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:59:16,399 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand 5 states.