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-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:02:11,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:02:11,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:02:11,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:02:11,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:02:11,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:02:11,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:02:11,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:02:11,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:02:11,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:02:11,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:02:11,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:02:11,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:02:11,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:02:12,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:02:12,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:02:12,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:02:12,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:02:12,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:02:12,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:02:12,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:02:12,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:02:12,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:02:12,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:02:12,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:02:12,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:02:12,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:02:12,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:02:12,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:02:12,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:02:12,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:02:12,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:02:12,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:02:12,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:02:12,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:02:12,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:02:12,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:02:12,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:02:12,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:02:12,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:02:12,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:02:12,046 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:12,065 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:02:12,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:02:12,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:02:12,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:02:12,068 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:02:12,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:02:12,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:02:12,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:02:12,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:02:12,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:02:12,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:02:12,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:02:12,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:02:12,071 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:02:12,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:02:12,072 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:02:12,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:02:12,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:02:12,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:02:12,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:02:12,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:02:12,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:02:12,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:02:12,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:02:12,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:02:12,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:02:12,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:02:12,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:02:12,074 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:12,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:02:12,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:02:12,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:02:12,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:02:12,419 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:02:12,420 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-15 03:02:12,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee2d6c9c/85b88168d2c14b8fba4c57e0250056ed/FLAG642420ddf [2019-10-15 03:02:13,010 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:02:13,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-15 03:02:13,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee2d6c9c/85b88168d2c14b8fba4c57e0250056ed/FLAG642420ddf [2019-10-15 03:02:13,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee2d6c9c/85b88168d2c14b8fba4c57e0250056ed [2019-10-15 03:02:13,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:02:13,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:02:13,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:13,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:02:13,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:02:13,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:13" (1/1) ... [2019-10-15 03:02:13,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef99201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:13, skipping insertion in model container [2019-10-15 03:02:13,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:13" (1/1) ... [2019-10-15 03:02:13,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:02:13,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:02:13,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:13,751 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:02:13,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:13,953 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:02:13,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:13 WrapperNode [2019-10-15 03:02:13,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:13,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:02:13,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:02:13,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:02:13,971 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:13" (1/1) ... [2019-10-15 03:02:13,971 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:13" (1/1) ... [2019-10-15 03:02:13,984 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:13" (1/1) ... [2019-10-15 03:02:13,985 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:13" (1/1) ... [2019-10-15 03:02:14,003 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:13" (1/1) ... [2019-10-15 03:02:14,008 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:13" (1/1) ... [2019-10-15 03:02:14,011 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:13" (1/1) ... [2019-10-15 03:02:14,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:02:14,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:02:14,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:02:14,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:02:14,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:13" (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:14,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:02:14,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:02:14,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:02:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:02:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:02:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:02:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:02:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:02:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:02:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:02:14,644 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:02:14,645 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:02:14,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:14 BoogieIcfgContainer [2019-10-15 03:02:14,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:02:14,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:02:14,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:02:14,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:02:14,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:02:13" (1/3) ... [2019-10-15 03:02:14,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a2569b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:14, skipping insertion in model container [2019-10-15 03:02:14,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:13" (2/3) ... [2019-10-15 03:02:14,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a2569b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:14, skipping insertion in model container [2019-10-15 03:02:14,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:14" (3/3) ... [2019-10-15 03:02:14,655 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-10-15 03:02:14,665 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:02:14,674 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-15 03:02:14,685 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-15 03:02:14,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:02:14,712 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:02:14,712 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:02:14,712 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:02:14,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:02:14,713 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:02:14,713 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:02:14,713 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:02:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-15 03:02:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:02:14,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:14,743 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:14,745 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:14,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1240490557, now seen corresponding path program 1 times [2019-10-15 03:02:14,758 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:14,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024175380] [2019-10-15 03:02:14,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:14,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:14,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:14,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:14,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024175380] [2019-10-15 03:02:14,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:14,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:02:14,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928438774] [2019-10-15 03:02:14,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:02:14,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:14,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:02:14,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:02:14,946 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-10-15 03:02:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:14,979 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2019-10-15 03:02:14,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:02:14,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:02:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:14,993 INFO L225 Difference]: With dead ends: 92 [2019-10-15 03:02:14,993 INFO L226 Difference]: Without dead ends: 79 [2019-10-15 03:02:14,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:02:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-15 03:02:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-15 03:02:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-15 03:02:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-10-15 03:02:15,049 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2019-10-15 03:02:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:15,049 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-10-15 03:02:15,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:02:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-10-15 03:02:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:02:15,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:15,053 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:15,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash -199495303, now seen corresponding path program 1 times [2019-10-15 03:02:15,057 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:15,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936919755] [2019-10-15 03:02:15,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:15,190 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:15,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936919755] [2019-10-15 03:02:15,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:15,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:15,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758951916] [2019-10-15 03:02:15,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:15,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:15,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:15,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:15,202 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 6 states. [2019-10-15 03:02:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:15,344 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-10-15 03:02:15,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:15,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-15 03:02:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:15,348 INFO L225 Difference]: With dead ends: 79 [2019-10-15 03:02:15,348 INFO L226 Difference]: Without dead ends: 77 [2019-10-15 03:02:15,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-15 03:02:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-15 03:02:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 03:02:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-10-15 03:02:15,370 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2019-10-15 03:02:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:15,371 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-10-15 03:02:15,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-10-15 03:02:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:02:15,375 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:15,375 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] [2019-10-15 03:02:15,376 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1558638364, now seen corresponding path program 1 times [2019-10-15 03:02:15,377 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:15,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989066749] [2019-10-15 03:02:15,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:15,450 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:15,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989066749] [2019-10-15 03:02:15,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:15,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:15,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377287563] [2019-10-15 03:02:15,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:15,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:15,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:15,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:15,454 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 4 states. [2019-10-15 03:02:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:15,591 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-10-15 03:02:15,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:15,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 03:02:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:15,594 INFO L225 Difference]: With dead ends: 100 [2019-10-15 03:02:15,594 INFO L226 Difference]: Without dead ends: 98 [2019-10-15 03:02:15,597 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:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-15 03:02:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-10-15 03:02:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 03:02:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-10-15 03:02:15,615 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 21 [2019-10-15 03:02:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:15,616 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-10-15 03:02:15,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-10-15 03:02:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:02:15,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:15,620 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] [2019-10-15 03:02:15,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1073152137, now seen corresponding path program 1 times [2019-10-15 03:02:15,622 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:15,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150137864] [2019-10-15 03:02:15,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:15,737 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:15,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150137864] [2019-10-15 03:02:15,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:15,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:15,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648633719] [2019-10-15 03:02:15,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:15,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:15,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:15,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:15,740 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-10-15 03:02:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:15,882 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-10-15 03:02:15,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:15,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-15 03:02:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:15,884 INFO L225 Difference]: With dead ends: 75 [2019-10-15 03:02:15,886 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 03:02:15,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 03:02:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-15 03:02:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 03:02:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-10-15 03:02:15,904 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 22 [2019-10-15 03:02:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:15,905 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-10-15 03:02:15,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-10-15 03:02:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:02:15,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:15,907 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] [2019-10-15 03:02:15,907 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1458097995, now seen corresponding path program 1 times [2019-10-15 03:02:15,908 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:15,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007812509] [2019-10-15 03:02:15,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:15,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:16,016 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:16,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007812509] [2019-10-15 03:02:16,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:16,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:16,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320491941] [2019-10-15 03:02:16,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:16,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:16,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:16,019 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2019-10-15 03:02:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:16,300 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2019-10-15 03:02:16,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:16,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-15 03:02:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:16,303 INFO L225 Difference]: With dead ends: 140 [2019-10-15 03:02:16,303 INFO L226 Difference]: Without dead ends: 138 [2019-10-15 03:02:16,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-15 03:02:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 76. [2019-10-15 03:02:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-15 03:02:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-10-15 03:02:16,314 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 25 [2019-10-15 03:02:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:16,318 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-10-15 03:02:16,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-10-15 03:02:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:02:16,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:16,320 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] [2019-10-15 03:02:16,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:16,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:16,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1454364186, now seen corresponding path program 1 times [2019-10-15 03:02:16,322 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:16,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685410275] [2019-10-15 03:02:16,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:16,322 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:16,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:16,435 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:16,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685410275] [2019-10-15 03:02:16,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:16,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:16,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542526801] [2019-10-15 03:02:16,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:16,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:16,440 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2019-10-15 03:02:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:16,620 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-10-15 03:02:16,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:16,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-15 03:02:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:16,623 INFO L225 Difference]: With dead ends: 107 [2019-10-15 03:02:16,623 INFO L226 Difference]: Without dead ends: 105 [2019-10-15 03:02:16,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-15 03:02:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2019-10-15 03:02:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-15 03:02:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-10-15 03:02:16,632 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 25 [2019-10-15 03:02:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:16,633 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-10-15 03:02:16,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-10-15 03:02:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:02:16,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:16,634 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] [2019-10-15 03:02:16,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:16,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2043605651, now seen corresponding path program 1 times [2019-10-15 03:02:16,636 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:16,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655373303] [2019-10-15 03:02:16,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:16,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:16,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:16,732 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:16,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655373303] [2019-10-15 03:02:16,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:16,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:16,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640821891] [2019-10-15 03:02:16,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:16,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:16,734 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 5 states. [2019-10-15 03:02:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:16,886 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2019-10-15 03:02:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:16,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 03:02:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:16,888 INFO L225 Difference]: With dead ends: 120 [2019-10-15 03:02:16,888 INFO L226 Difference]: Without dead ends: 118 [2019-10-15 03:02:16,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-15 03:02:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 76. [2019-10-15 03:02:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-15 03:02:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-10-15 03:02:16,898 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 26 [2019-10-15 03:02:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:16,899 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-10-15 03:02:16,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-10-15 03:02:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:02:16,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:16,900 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] [2019-10-15 03:02:16,901 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:16,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2135613676, now seen corresponding path program 1 times [2019-10-15 03:02:16,902 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:16,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731408] [2019-10-15 03:02:16,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:16,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:16,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:16,951 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:16,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731408] [2019-10-15 03:02:16,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:16,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:16,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344200306] [2019-10-15 03:02:16,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:16,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:16,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:16,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:16,953 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2019-10-15 03:02:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:17,043 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-10-15 03:02:17,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:17,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-15 03:02:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:17,045 INFO L225 Difference]: With dead ends: 76 [2019-10-15 03:02:17,045 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 03:02:17,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 03:02:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-15 03:02:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-15 03:02:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-10-15 03:02:17,053 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 26 [2019-10-15 03:02:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:17,053 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-10-15 03:02:17,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-10-15 03:02:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:02:17,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:17,055 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] [2019-10-15 03:02:17,055 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash 669725210, now seen corresponding path program 1 times [2019-10-15 03:02:17,056 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:17,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674237417] [2019-10-15 03:02:17,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:17,121 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:17,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674237417] [2019-10-15 03:02:17,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:17,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:02:17,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700947344] [2019-10-15 03:02:17,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:02:17,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:02:17,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:02:17,124 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 3 states. [2019-10-15 03:02:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:17,173 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-10-15 03:02:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:02:17,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:02:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:17,174 INFO L225 Difference]: With dead ends: 114 [2019-10-15 03:02:17,174 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 03:02:17,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:02:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 03:02:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-15 03:02:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-15 03:02:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-10-15 03:02:17,191 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 28 [2019-10-15 03:02:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:17,191 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-10-15 03:02:17,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:02:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-10-15 03:02:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:02:17,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:17,196 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] [2019-10-15 03:02:17,196 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash 144873553, now seen corresponding path program 1 times [2019-10-15 03:02:17,197 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:17,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102103374] [2019-10-15 03:02:17,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:17,274 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:17,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102103374] [2019-10-15 03:02:17,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:17,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:17,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787584687] [2019-10-15 03:02:17,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:17,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:17,282 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-10-15 03:02:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:17,352 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-10-15 03:02:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:17,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-15 03:02:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:17,354 INFO L225 Difference]: With dead ends: 75 [2019-10-15 03:02:17,354 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 03:02:17,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 03:02:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-15 03:02:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-15 03:02:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-10-15 03:02:17,362 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 29 [2019-10-15 03:02:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:17,362 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-10-15 03:02:17,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-10-15 03:02:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:02:17,363 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:17,363 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 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:17,364 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -106234418, now seen corresponding path program 1 times [2019-10-15 03:02:17,365 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:17,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166019551] [2019-10-15 03:02:17,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:02:17,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166019551] [2019-10-15 03:02:17,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667001630] [2019-10-15 03:02:17,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:17,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 03:02:17,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:02:17,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:02:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:02:17,594 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:02:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:02:17,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1651906959] [2019-10-15 03:02:17,656 INFO L162 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-10-15 03:02:17,657 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:02:17,663 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:02:17,671 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:02:17,671 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:02:17,755 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2019-10-15 03:02:18,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-15 03:02:18,408 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-15 03:02:19,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2019-10-15 03:02:19,550 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:02:20,290 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-15 03:02:21,591 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-10-15 03:02:21,953 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-10-15 03:02:22,198 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-15 03:02:22,619 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-15 03:02:22,971 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-10-15 03:02:23,275 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-15 03:02:23,582 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-10-15 03:02:23,612 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:02:23,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 24] total 33 [2019-10-15 03:02:23,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535015135] [2019-10-15 03:02:23,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-15 03:02:23,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:23,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-15 03:02:23,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 03:02:23,615 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 33 states. [2019-10-15 03:02:24,506 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-10-15 03:02:24,705 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-10-15 03:02:24,911 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-10-15 03:02:25,164 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-10-15 03:02:25,495 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-10-15 03:02:25,820 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-10-15 03:02:26,151 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-10-15 03:02:26,419 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-10-15 03:02:26,739 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-10-15 03:02:27,079 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-10-15 03:02:27,584 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-10-15 03:02:27,996 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-10-15 03:02:28,246 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-15 03:02:28,639 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-10-15 03:02:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:28,853 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2019-10-15 03:02:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-15 03:02:28,854 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-10-15 03:02:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:28,858 INFO L225 Difference]: With dead ends: 153 [2019-10-15 03:02:28,858 INFO L226 Difference]: Without dead ends: 151 [2019-10-15 03:02:28,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1150, Invalid=2510, Unknown=0, NotChecked=0, Total=3660 [2019-10-15 03:02:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-15 03:02:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 69. [2019-10-15 03:02:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-15 03:02:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-10-15 03:02:28,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 29 [2019-10-15 03:02:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:28,883 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-10-15 03:02:28,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-15 03:02:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-10-15 03:02:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:02:28,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:28,885 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] [2019-10-15 03:02:29,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:29,094 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:29,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash 196115995, now seen corresponding path program 1 times [2019-10-15 03:02:29,094 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:29,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392816707] [2019-10-15 03:02:29,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:29,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:29,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:29,175 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:29,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392816707] [2019-10-15 03:02:29,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:29,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:29,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736473237] [2019-10-15 03:02:29,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:29,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:29,178 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 5 states. [2019-10-15 03:02:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:29,263 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-10-15 03:02:29,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:29,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-15 03:02:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:29,264 INFO L225 Difference]: With dead ends: 69 [2019-10-15 03:02:29,264 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 03:02:29,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 03:02:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-15 03:02:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-15 03:02:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-15 03:02:29,271 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 30 [2019-10-15 03:02:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:29,272 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-15 03:02:29,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-15 03:02:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:02:29,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:29,273 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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:29,274 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 998251798, now seen corresponding path program 1 times [2019-10-15 03:02:29,274 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:29,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813156027] [2019-10-15 03:02:29,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:29,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:29,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:02:29,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813156027] [2019-10-15 03:02:29,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901809311] [2019-10-15 03:02:29,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:29,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 03:02:29,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:02:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:02:29,509 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:02:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:02:29,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42321659] [2019-10-15 03:02:29,548 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-15 03:02:29,549 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:02:29,549 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:02:29,549 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:02:29,550 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:02:29,573 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2019-10-15 03:02:29,961 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-15 03:02:29,979 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-15 03:02:30,699 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2019-10-15 03:02:30,703 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:02:31,437 WARN L191 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-10-15 03:02:32,558 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2019-10-15 03:02:32,749 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-10-15 03:02:32,888 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-15 03:02:33,058 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-15 03:02:33,267 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-15 03:02:33,894 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-10-15 03:02:34,542 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-10-15 03:02:34,810 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-15 03:02:35,123 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-10-15 03:02:35,507 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-10-15 03:02:35,884 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-10-15 03:02:35,918 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:02:35,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 26] total 35 [2019-10-15 03:02:35,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488918572] [2019-10-15 03:02:35,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-15 03:02:35,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-15 03:02:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 03:02:35,921 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 35 states. [2019-10-15 03:02:36,734 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-10-15 03:02:36,914 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-10-15 03:02:37,157 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-10-15 03:02:37,562 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 61 [2019-10-15 03:02:38,034 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-10-15 03:02:38,362 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2019-10-15 03:02:38,852 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-10-15 03:02:39,378 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-10-15 03:02:39,768 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2019-10-15 03:02:40,222 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2019-10-15 03:02:40,557 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2019-10-15 03:02:41,048 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-10-15 03:02:41,552 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2019-10-15 03:02:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:41,687 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-10-15 03:02:41,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-15 03:02:41,687 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 30 [2019-10-15 03:02:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:41,689 INFO L225 Difference]: With dead ends: 96 [2019-10-15 03:02:41,689 INFO L226 Difference]: Without dead ends: 94 [2019-10-15 03:02:41,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1121, Invalid=2661, Unknown=0, NotChecked=0, Total=3782 [2019-10-15 03:02:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-15 03:02:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-10-15 03:02:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-15 03:02:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-15 03:02:41,701 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 30 [2019-10-15 03:02:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:41,703 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-15 03:02:41,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-15 03:02:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-15 03:02:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 03:02:41,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:41,706 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] [2019-10-15 03:02:41,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:41,910 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1339182842, now seen corresponding path program 1 times [2019-10-15 03:02:41,912 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:41,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066306852] [2019-10-15 03:02:41,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:41,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:41,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:41,960 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,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066306852] [2019-10-15 03:02:41,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:41,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:41,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520093508] [2019-10-15 03:02:41,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:41,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:41,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:41,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:41,962 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-10-15 03:02:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:42,041 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-10-15 03:02:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:42,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-15 03:02:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:42,042 INFO L225 Difference]: With dead ends: 62 [2019-10-15 03:02:42,043 INFO L226 Difference]: Without dead ends: 60 [2019-10-15 03:02:42,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-15 03:02:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-15 03:02:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-15 03:02:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-15 03:02:42,049 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2019-10-15 03:02:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:42,050 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-15 03:02:42,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-15 03:02:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 03:02:42,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:42,051 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] [2019-10-15 03:02:42,052 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1435001690, now seen corresponding path program 1 times [2019-10-15 03:02:42,052 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:42,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994340090] [2019-10-15 03:02:42,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:42,101 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:42,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994340090] [2019-10-15 03:02:42,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:42,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:02:42,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784998171] [2019-10-15 03:02:42,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:02:42,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:42,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:02:42,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:42,104 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 7 states. [2019-10-15 03:02:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:42,334 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-15 03:02:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:42,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-10-15 03:02:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:42,336 INFO L225 Difference]: With dead ends: 70 [2019-10-15 03:02:42,336 INFO L226 Difference]: Without dead ends: 68 [2019-10-15 03:02:42,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:02:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-15 03:02:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2019-10-15 03:02:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-15 03:02:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-15 03:02:42,342 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-10-15 03:02:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:42,342 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-15 03:02:42,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:02:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-15 03:02:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:02:42,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:42,344 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] [2019-10-15 03:02:42,344 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1972205027, now seen corresponding path program 1 times [2019-10-15 03:02:42,345 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:42,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662746374] [2019-10-15 03:02:42,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:42,385 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:42,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662746374] [2019-10-15 03:02:42,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:42,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:42,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588871070] [2019-10-15 03:02:42,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:42,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:42,387 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-10-15 03:02:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:42,568 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-10-15 03:02:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:42,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-10-15 03:02:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:42,569 INFO L225 Difference]: With dead ends: 90 [2019-10-15 03:02:42,569 INFO L226 Difference]: Without dead ends: 88 [2019-10-15 03:02:42,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-15 03:02:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2019-10-15 03:02:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-15 03:02:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-15 03:02:42,577 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 37 [2019-10-15 03:02:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:42,577 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-15 03:02:42,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-15 03:02:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 03:02:42,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:42,578 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] [2019-10-15 03:02:42,579 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1008816880, now seen corresponding path program 1 times [2019-10-15 03:02:42,580 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:42,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015862078] [2019-10-15 03:02:42,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:42,659 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:42,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015862078] [2019-10-15 03:02:42,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:42,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:42,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598416136] [2019-10-15 03:02:42,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:42,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:42,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:42,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:42,661 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-10-15 03:02:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:42,764 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-10-15 03:02:42,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:42,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 03:02:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:42,765 INFO L225 Difference]: With dead ends: 60 [2019-10-15 03:02:42,766 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 03:02:42,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 03:02:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-15 03:02:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-15 03:02:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-15 03:02:42,772 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 38 [2019-10-15 03:02:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:42,772 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-15 03:02:42,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-15 03:02:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:02:42,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:42,773 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] [2019-10-15 03:02:42,774 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:42,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1189488013, now seen corresponding path program 1 times [2019-10-15 03:02:42,774 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:42,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920553489] [2019-10-15 03:02:42,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:42,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920553489] [2019-10-15 03:02:42,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:42,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:42,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32385481] [2019-10-15 03:02:42,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:42,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:42,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:42,819 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-10-15 03:02:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:42,840 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-10-15 03:02:42,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:42,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-15 03:02:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:42,841 INFO L225 Difference]: With dead ends: 69 [2019-10-15 03:02:42,841 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 03:02:42,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 03:02:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-10-15 03:02:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-15 03:02:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-15 03:02:42,848 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 40 [2019-10-15 03:02:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:42,848 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-15 03:02:42,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-15 03:02:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:02:42,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:42,849 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] [2019-10-15 03:02:42,850 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:42,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1780580463, now seen corresponding path program 1 times [2019-10-15 03:02:42,850 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:42,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142978504] [2019-10-15 03:02:42,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:42,917 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:42,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142978504] [2019-10-15 03:02:42,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:42,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:42,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910730319] [2019-10-15 03:02:42,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:42,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:42,919 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-15 03:02:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:42,954 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-15 03:02:42,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:42,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 03:02:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:42,956 INFO L225 Difference]: With dead ends: 67 [2019-10-15 03:02:42,956 INFO L226 Difference]: Without dead ends: 65 [2019-10-15 03:02:42,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-15 03:02:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-15 03:02:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-15 03:02:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-15 03:02:42,964 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 41 [2019-10-15 03:02:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:42,964 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-15 03:02:42,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-15 03:02:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:02:42,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:42,965 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] [2019-10-15 03:02:42,965 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash -636577287, now seen corresponding path program 1 times [2019-10-15 03:02:42,966 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:42,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110304614] [2019-10-15 03:02:42,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:42,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:43,027 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:43,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110304614] [2019-10-15 03:02:43,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:43,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:43,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842071955] [2019-10-15 03:02:43,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:43,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:43,029 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-10-15 03:02:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:43,243 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-10-15 03:02:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:43,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-15 03:02:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:43,246 INFO L225 Difference]: With dead ends: 89 [2019-10-15 03:02:43,246 INFO L226 Difference]: Without dead ends: 87 [2019-10-15 03:02:43,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-15 03:02:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2019-10-15 03:02:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-15 03:02:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-15 03:02:43,255 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 42 [2019-10-15 03:02:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:43,256 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-15 03:02:43,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-15 03:02:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:02:43,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:43,256 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,257 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1734863350, now seen corresponding path program 1 times [2019-10-15 03:02:43,257 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:43,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040735072] [2019-10-15 03:02:43,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:43,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:43,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:43,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040735072] [2019-10-15 03:02:43,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033709977] [2019-10-15 03:02:43,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:43,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 03:02:43,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:02:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:43,512 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:02:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:43,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1682070916] [2019-10-15 03:02:43,589 INFO L162 IcfgInterpreter]: Started Sifa with 41 locations of interest [2019-10-15 03:02:43,590 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:02:43,590 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:02:43,590 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:02:43,591 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:02:43,608 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2019-10-15 03:02:44,043 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-15 03:02:44,060 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-15 03:02:44,142 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-15 03:02:45,187 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2019-10-15 03:02:45,190 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:02:45,814 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 108 [2019-10-15 03:02:47,092 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2019-10-15 03:02:47,287 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-10-15 03:02:47,449 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-15 03:02:47,616 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-15 03:02:47,837 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-15 03:02:48,145 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-15 03:02:48,462 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-15 03:02:48,824 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-15 03:02:49,208 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-10-15 03:02:49,645 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-10-15 03:02:50,074 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-10-15 03:02:50,677 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-10-15 03:02:51,297 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2019-10-15 03:02:52,973 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 127 DAG size of output: 125 [2019-10-15 03:02:53,757 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-10-15 03:02:54,404 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-10-15 03:02:55,122 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115