/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --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/loops/vogal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:04:10,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:04:10,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:04:10,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:04:10,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:04:10,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:04:10,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:04:10,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:04:10,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:04:10,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:04:10,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:04:10,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:04:10,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:04:10,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:04:10,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:04:10,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:04:10,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:04:10,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:04:10,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:04:10,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:04:10,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:04:10,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:04:10,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:04:10,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:04:10,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:04:10,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:04:10,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:04:10,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:04:10,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:04:10,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:04:10,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:04:10,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:04:10,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:04:10,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:04:10,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:04:10,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:04:10,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:04:10,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:04:10,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:04:10,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:04:10,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:04:10,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:04:10,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:04:10,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:04:10,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:04:10,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:04:10,768 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:04:10,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:04:10,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:04:10,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:04:10,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:04:10,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:04:10,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:04:10,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:04:10,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:04:10,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:04:10,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:04:10,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:04:10,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:04:10,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:04:10,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:04:10,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:04:10,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:04:10,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:04:10,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:04:10,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:04:10,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:04:10,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:04:10,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:04:10,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:04:10,773 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-11-07 04:04:11,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:04:11,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:04:11,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:04:11,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:04:11,104 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:04:11,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-1.i [2019-11-07 04:04:11,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053382070/dd9d360539b24498a03ec47d1e6dbb86/FLAG8fe70e9ab [2019-11-07 04:04:11,581 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:04:11,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2019-11-07 04:04:11,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053382070/dd9d360539b24498a03ec47d1e6dbb86/FLAG8fe70e9ab [2019-11-07 04:04:12,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053382070/dd9d360539b24498a03ec47d1e6dbb86 [2019-11-07 04:04:12,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:04:12,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:04:12,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:04:12,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:04:12,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:04:12,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a385adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12, skipping insertion in model container [2019-11-07 04:04:12,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,096 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:04:12,142 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:04:12,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:04:12,453 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:04:12,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:04:12,604 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:04:12,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12 WrapperNode [2019-11-07 04:04:12,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:04:12,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:04:12,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:04:12,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:04:12,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... [2019-11-07 04:04:12,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:04:12,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:04:12,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:04:12,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:04:12,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:04:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:04:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:04:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 04:04:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:04:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:04:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:04:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:04:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:04:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:04:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 04:04:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-07 04:04:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 04:04:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 04:04:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 04:04:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:04:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:04:13,219 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:04:13,219 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-07 04:04:13,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:04:13 BoogieIcfgContainer [2019-11-07 04:04:13,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:04:13,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:04:13,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:04:13,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:04:13,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:04:12" (1/3) ... [2019-11-07 04:04:13,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17aa61d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:04:13, skipping insertion in model container [2019-11-07 04:04:13,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:12" (2/3) ... [2019-11-07 04:04:13,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17aa61d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:04:13, skipping insertion in model container [2019-11-07 04:04:13,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:04:13" (3/3) ... [2019-11-07 04:04:13,229 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2019-11-07 04:04:13,239 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:04:13,253 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:04:13,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:04:13,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:04:13,286 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:04:13,286 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:04:13,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:04:13,287 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:04:13,287 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:04:13,287 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:04:13,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:04:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-07 04:04:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:04:13,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:13,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:04:13,309 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1006628031, now seen corresponding path program 1 times [2019-11-07 04:04:13,323 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:13,324 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276365399] [2019-11-07 04:04:13,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:04:13,466 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276365399] [2019-11-07 04:04:13,467 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:04:13,467 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 04:04:13,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903928082] [2019-11-07 04:04:13,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 04:04:13,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:13,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 04:04:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 04:04:13,499 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-11-07 04:04:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:13,532 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-11-07 04:04:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 04:04:13,534 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-07 04:04:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:13,544 INFO L225 Difference]: With dead ends: 45 [2019-11-07 04:04:13,545 INFO L226 Difference]: Without dead ends: 20 [2019-11-07 04:04:13,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 04:04:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-07 04:04:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-07 04:04:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-07 04:04:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-07 04:04:13,586 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2019-11-07 04:04:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:13,587 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-07 04:04:13,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 04:04:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-11-07 04:04:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:04:13,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:13,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:04:13,589 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash 154465315, now seen corresponding path program 1 times [2019-11-07 04:04:13,589 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:13,590 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630916759] [2019-11-07 04:04:13,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:04:13,684 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630916759] [2019-11-07 04:04:13,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:04:13,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:04:13,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106234031] [2019-11-07 04:04:13,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:04:13,687 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:04:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:04:13,688 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 3 states. [2019-11-07 04:04:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:13,738 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-11-07 04:04:13,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:04:13,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 04:04:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:13,741 INFO L225 Difference]: With dead ends: 41 [2019-11-07 04:04:13,741 INFO L226 Difference]: Without dead ends: 27 [2019-11-07 04:04:13,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:04:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-07 04:04:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-07 04:04:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-07 04:04:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-07 04:04:13,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2019-11-07 04:04:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:13,751 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-07 04:04:13,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:04:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-11-07 04:04:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:04:13,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:13,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:04:13,752 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -415101532, now seen corresponding path program 1 times [2019-11-07 04:04:13,753 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:13,754 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885951615] [2019-11-07 04:04:13,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:04:13,868 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885951615] [2019-11-07 04:04:13,868 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205187678] [2019-11-07 04:04:13,868 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-11-07 04:04:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:13,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-07 04:04:13,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:04:14,024 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:04:14,113 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:04:14,113 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 12 [2019-11-07 04:04:14,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618855590] [2019-11-07 04:04:14,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:04:14,114 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:14,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:04:14,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:04:14,115 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 10 states. [2019-11-07 04:04:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:14,202 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-11-07 04:04:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:04:14,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-07 04:04:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:14,206 INFO L225 Difference]: With dead ends: 35 [2019-11-07 04:04:14,206 INFO L226 Difference]: Without dead ends: 30 [2019-11-07 04:04:14,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:04:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-07 04:04:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-11-07 04:04:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-07 04:04:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-07 04:04:14,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2019-11-07 04:04:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:14,219 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-07 04:04:14,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:04:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-07 04:04:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 04:04:14,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:14,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:04:14,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:14,436 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1072112129, now seen corresponding path program 1 times [2019-11-07 04:04:14,436 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:14,436 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353705607] [2019-11-07 04:04:14,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:04:14,606 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353705607] [2019-11-07 04:04:14,607 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:04:14,607 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:04:14,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675958968] [2019-11-07 04:04:14,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:04:14,609 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:14,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:04:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:04:14,609 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 3 states. [2019-11-07 04:04:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:14,638 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2019-11-07 04:04:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:04:14,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 04:04:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:14,640 INFO L225 Difference]: With dead ends: 52 [2019-11-07 04:04:14,640 INFO L226 Difference]: Without dead ends: 37 [2019-11-07 04:04:14,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:04:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-07 04:04:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-11-07 04:04:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-07 04:04:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-07 04:04:14,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 21 [2019-11-07 04:04:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:14,657 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-07 04:04:14,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:04:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-11-07 04:04:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 04:04:14,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:14,661 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:04:14,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1398520043, now seen corresponding path program 1 times [2019-11-07 04:04:14,662 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:14,662 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365404616] [2019-11-07 04:04:14,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:04:14,760 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365404616] [2019-11-07 04:04:14,761 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670428219] [2019-11-07 04:04:14,763 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-11-07 04:04:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:14,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-07 04:04:14,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:14,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-07 04:04:14,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 04:04:14,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 04:04:14,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 04:04:14,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-07 04:04:14,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-07 04:04:14,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 04:04:14,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 04:04:14,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 04:04:14,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-07 04:04:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:04:15,022 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:04:15,142 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:04:15,143 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-11-07 04:04:15,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039875404] [2019-11-07 04:04:15,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:04:15,144 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:04:15,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:04:15,145 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 7 states. [2019-11-07 04:04:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:15,353 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-11-07 04:04:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:04:15,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-07 04:04:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:15,354 INFO L225 Difference]: With dead ends: 43 [2019-11-07 04:04:15,354 INFO L226 Difference]: Without dead ends: 28 [2019-11-07 04:04:15,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-11-07 04:04:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-07 04:04:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-07 04:04:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-07 04:04:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-07 04:04:15,361 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 22 [2019-11-07 04:04:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:15,361 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-07 04:04:15,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:04:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-11-07 04:04:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 04:04:15,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:15,363 INFO L410 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] [2019-11-07 04:04:15,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:15,570 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash -392356454, now seen corresponding path program 1 times [2019-11-07 04:04:15,571 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:15,571 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603896107] [2019-11-07 04:04:15,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:04:15,640 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603896107] [2019-11-07 04:04:15,640 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783240514] [2019-11-07 04:04:15,641 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-11-07 04:04:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:15,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-07 04:04:15,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:15,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-07 04:04:15,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 04:04:15,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 04:04:15,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 04:04:15,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-07 04:04:15,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-07 04:04:15,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 04:04:15,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 04:04:15,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 04:04:15,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-07 04:04:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:04:15,794 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:04:15,914 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:04:15,914 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-11-07 04:04:15,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995807383] [2019-11-07 04:04:15,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:04:15,915 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:04:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:04:15,916 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 7 states. [2019-11-07 04:04:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:16,090 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2019-11-07 04:04:16,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:04:16,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-07 04:04:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:16,091 INFO L225 Difference]: With dead ends: 42 [2019-11-07 04:04:16,091 INFO L226 Difference]: Without dead ends: 37 [2019-11-07 04:04:16,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-11-07 04:04:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-07 04:04:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-11-07 04:04:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-07 04:04:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-11-07 04:04:16,098 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 23 [2019-11-07 04:04:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:16,099 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-07 04:04:16,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:04:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-11-07 04:04:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 04:04:16,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:16,100 INFO L410 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] [2019-11-07 04:04:16,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:16,301 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash 996109488, now seen corresponding path program 1 times [2019-11-07 04:04:16,302 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:16,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421245234] [2019-11-07 04:04:16,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 04:04:16,374 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421245234] [2019-11-07 04:04:16,374 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626369468] [2019-11-07 04:04:16,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:16,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-07 04:04:16,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 04:04:16,465 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:04:16,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [160867517] [2019-11-07 04:04:16,536 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:04:16,537 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:04:16,548 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:04:16,555 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:04:16,556 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:04:16,648 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:04:16,902 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-07 04:04:17,010 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-11-07 04:04:17,020 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:04:17,023 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:04:17,626 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 04:04:17,626 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 5] total 21 [2019-11-07 04:04:17,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678691618] [2019-11-07 04:04:17,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 04:04:17,629 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:17,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 04:04:17,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-11-07 04:04:17,629 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 15 states. [2019-11-07 04:04:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:18,122 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2019-11-07 04:04:18,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:04:18,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-11-07 04:04:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:18,123 INFO L225 Difference]: With dead ends: 45 [2019-11-07 04:04:18,123 INFO L226 Difference]: Without dead ends: 32 [2019-11-07 04:04:18,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2019-11-07 04:04:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-07 04:04:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-07 04:04:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 04:04:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-07 04:04:18,132 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24 [2019-11-07 04:04:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:18,133 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-07 04:04:18,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 04:04:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-11-07 04:04:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 04:04:18,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:18,134 INFO L410 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] [2019-11-07 04:04:18,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:18,335 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1005124724, now seen corresponding path program 1 times [2019-11-07 04:04:18,336 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:18,336 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045674341] [2019-11-07 04:04:18,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:04:18,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045674341] [2019-11-07 04:04:18,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820729745] [2019-11-07 04:04:18,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:18,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-07 04:04:18,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:04:18,511 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 04:04:18,526 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:04:18,527 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2019-11-07 04:04:18,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066150265] [2019-11-07 04:04:18,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:04:18,528 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:04:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:04:18,529 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2019-11-07 04:04:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:18,557 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-11-07 04:04:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:04:18,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 04:04:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:18,560 INFO L225 Difference]: With dead ends: 46 [2019-11-07 04:04:18,560 INFO L226 Difference]: Without dead ends: 29 [2019-11-07 04:04:18,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:04:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-07 04:04:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-07 04:04:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-07 04:04:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-07 04:04:18,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 26 [2019-11-07 04:04:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:18,571 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-07 04:04:18,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:04:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-07 04:04:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 04:04:18,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:18,573 INFO L410 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] [2019-11-07 04:04:18,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:18,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 270654945, now seen corresponding path program 1 times [2019-11-07 04:04:18,775 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:18,775 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485419921] [2019-11-07 04:04:18,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-07 04:04:18,901 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485419921] [2019-11-07 04:04:18,901 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961226348] [2019-11-07 04:04:18,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:18,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-07 04:04:18,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:04:19,146 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:19,354 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-07 04:04:20,602 WARN L191 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 91 [2019-11-07 04:04:20,934 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-07 04:04:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:04:20,956 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923176788] [2019-11-07 04:04:20,958 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-11-07 04:04:20,958 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:04:20,959 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:04:20,959 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:04:20,959 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:04:20,981 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:04:21,074 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-07 04:04:21,423 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 04:04:21,432 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:04:21,434 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:04:22,404 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:04:22,404 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12, 10, 18] total 39 [2019-11-07 04:04:22,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25718519] [2019-11-07 04:04:22,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-07 04:04:22,405 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:22,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-07 04:04:22,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2019-11-07 04:04:22,407 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 39 states. [2019-11-07 04:04:23,594 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-07 04:04:23,842 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-07 04:04:24,480 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 97 [2019-11-07 04:04:25,013 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 93 [2019-11-07 04:04:25,550 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 85 [2019-11-07 04:04:25,742 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-07 04:04:26,214 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 88 [2019-11-07 04:04:26,861 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 92 [2019-11-07 04:04:27,368 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 95 [2019-11-07 04:04:27,573 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-11-07 04:04:28,100 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 89 [2019-11-07 04:04:28,345 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-07 04:04:29,054 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 97 [2019-11-07 04:04:29,695 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 104 [2019-11-07 04:04:30,270 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 100 [2019-11-07 04:04:30,971 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-11-07 04:04:31,543 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 106 [2019-11-07 04:04:31,773 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-07 04:04:32,283 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 102 [2019-11-07 04:04:32,829 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 106 [2019-11-07 04:04:33,773 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 94 [2019-11-07 04:04:34,640 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 101 [2019-11-07 04:04:35,476 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 96 [2019-11-07 04:04:36,059 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 103 [2019-11-07 04:04:36,247 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-11-07 04:04:36,848 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 98 [2019-11-07 04:04:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:36,889 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2019-11-07 04:04:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-07 04:04:36,890 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 27 [2019-11-07 04:04:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:36,890 INFO L225 Difference]: With dead ends: 86 [2019-11-07 04:04:36,891 INFO L226 Difference]: Without dead ends: 62 [2019-11-07 04:04:36,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=969, Invalid=5673, Unknown=0, NotChecked=0, Total=6642 [2019-11-07 04:04:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-07 04:04:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2019-11-07 04:04:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-07 04:04:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-11-07 04:04:36,905 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2019-11-07 04:04:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:36,905 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-11-07 04:04:36,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-07 04:04:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-11-07 04:04:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 04:04:36,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:36,906 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:04:37,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:37,110 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash -285428106, now seen corresponding path program 2 times [2019-11-07 04:04:37,111 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:37,111 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224100902] [2019-11-07 04:04:37,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 04:04:37,167 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224100902] [2019-11-07 04:04:37,167 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434484989] [2019-11-07 04:04:37,167 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:37,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-07 04:04:37,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:04:37,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-07 04:04:37,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 04:04:37,304 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 04:04:37,342 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1150133714] [2019-11-07 04:04:37,343 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-11-07 04:04:37,344 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:04:37,344 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:04:37,344 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:04:37,344 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:04:37,363 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:04:37,446 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-07 04:04:37,653 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-11-07 04:04:37,659 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:04:37,660 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:04:38,206 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:04:38,206 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5, 18] total 27 [2019-11-07 04:04:38,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521870632] [2019-11-07 04:04:38,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-07 04:04:38,208 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:04:38,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-07 04:04:38,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-11-07 04:04:38,209 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 27 states. [2019-11-07 04:04:39,436 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-11-07 04:04:39,742 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-07 04:04:40,668 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-07 04:04:44,417 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-07 04:04:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:04:45,822 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-11-07 04:04:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-07 04:04:45,823 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-11-07 04:04:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:04:45,825 INFO L225 Difference]: With dead ends: 108 [2019-11-07 04:04:45,825 INFO L226 Difference]: Without dead ends: 80 [2019-11-07 04:04:45,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=945, Invalid=4754, Unknown=1, NotChecked=0, Total=5700 [2019-11-07 04:04:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-07 04:04:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 34. [2019-11-07 04:04:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 04:04:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-11-07 04:04:45,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 29 [2019-11-07 04:04:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:04:45,836 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-07 04:04:45,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-07 04:04:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-11-07 04:04:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 04:04:45,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:04:45,837 INFO L410 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:04:46,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:46,046 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:04:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:04:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash -499834762, now seen corresponding path program 3 times [2019-11-07 04:04:46,046 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:04:46,046 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902248888] [2019-11-07 04:04:46,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:04:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:04:46,742 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-11-07 04:04:46,936 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 37 [2019-11-07 04:04:47,336 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 62 [2019-11-07 04:04:47,765 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 53 [2019-11-07 04:04:48,011 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-07 04:04:48,342 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2019-11-07 04:04:48,833 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 49 [2019-11-07 04:04:49,561 WARN L191 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 85 [2019-11-07 04:04:49,801 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 24 [2019-11-07 04:04:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 04:04:50,119 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902248888] [2019-11-07 04:04:50,119 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226259001] [2019-11-07 04:04:50,119 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:04:50,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 04:04:50,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:04:50,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-07 04:04:50,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:04:51,158 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-07 04:04:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:04:51,326 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:04:51,650 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-07 04:04:52,160 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-11-07 04:04:52,400 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-07 04:04:52,916 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-11-07 04:04:54,892 WARN L225 Elim1Store]: Array PQE input equivalent to true