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/reducercommutativity/max10-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:24:55,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:24:55,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:24:55,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:24:55,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:24:55,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:24:55,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:24:55,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:24:55,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:24:55,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:24:55,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:24:55,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:24:55,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:24:55,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:24:55,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:24:55,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:24:55,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:24:55,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:24:55,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:24:55,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:24:55,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:24:55,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:24:55,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:24:55,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:24:55,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:24:55,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:24:55,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:24:55,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:24:55,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:24:55,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:24:55,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:24:55,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:24:55,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:24:55,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:24:55,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:24:55,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:24:55,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:24:55,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:24:55,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:24:55,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:24:55,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:24:55,537 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:24:55,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:24:55,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:24:55,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:24:55,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:24:55,554 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:24:55,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:24:55,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:24:55,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:24:55,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:24:55,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:24:55,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:24:55,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:24:55,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:24:55,555 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:24:55,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:24:55,556 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:24:55,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:24:55,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:24:55,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:24:55,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:24:55,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:24:55,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:24:55,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:24:55,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:24:55,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:24:55,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:24:55,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:24:55,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:24:55,560 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:24:55,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:24:55,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:24:55,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:24:55,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:24:55,875 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:24:55,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max10-1.i [2019-10-15 03:24:55,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d1815ce/69a5209abedd474b93d2ec76a3597b1f/FLAG9adea201a [2019-10-15 03:24:56,383 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:24:56,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max10-1.i [2019-10-15 03:24:56,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d1815ce/69a5209abedd474b93d2ec76a3597b1f/FLAG9adea201a [2019-10-15 03:24:56,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d1815ce/69a5209abedd474b93d2ec76a3597b1f [2019-10-15 03:24:56,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:24:56,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:24:56,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:56,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:24:56,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:24:56,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:56" (1/1) ... [2019-10-15 03:24:56,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:56, skipping insertion in model container [2019-10-15 03:24:56,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:56" (1/1) ... [2019-10-15 03:24:56,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:24:56,831 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:24:56,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:57,006 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:24:57,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:57,125 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:24:57,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57 WrapperNode [2019-10-15 03:24:57,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:57,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:24:57,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:24:57,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:24:57,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (1/1) ... [2019-10-15 03:24:57,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (1/1) ... [2019-10-15 03:24:57,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (1/1) ... [2019-10-15 03:24:57,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (1/1) ... [2019-10-15 03:24:57,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (1/1) ... [2019-10-15 03:24:57,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (1/1) ... [2019-10-15 03:24:57,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (1/1) ... [2019-10-15 03:24:57,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:24:57,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:24:57,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:24:57,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:24:57,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (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:24:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:24:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:24:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-10-15 03:24:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:24:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:24:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:24:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-10-15 03:24:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:24:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:24:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:24:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:24:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:24:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:24:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:24:57,615 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:24:57,615 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 03:24:57,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:57 BoogieIcfgContainer [2019-10-15 03:24:57,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:24:57,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:24:57,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:24:57,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:24:57,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:24:56" (1/3) ... [2019-10-15 03:24:57,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641461df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:57, skipping insertion in model container [2019-10-15 03:24:57,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:57" (2/3) ... [2019-10-15 03:24:57,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641461df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:57, skipping insertion in model container [2019-10-15 03:24:57,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:57" (3/3) ... [2019-10-15 03:24:57,624 INFO L109 eAbstractionObserver]: Analyzing ICFG max10-1.i [2019-10-15 03:24:57,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:24:57,645 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:24:57,666 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:24:57,696 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:24:57,696 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:24:57,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:24:57,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:24:57,697 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:24:57,697 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:24:57,697 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:24:57,697 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:24:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 03:24:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:24:57,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:57,720 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:57,722 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash 855740909, now seen corresponding path program 1 times [2019-10-15 03:24:57,734 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:57,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333228625] [2019-10-15 03:24:57,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:57,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:57,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:24:57,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333228625] [2019-10-15 03:24:57,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:57,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:57,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258639798] [2019-10-15 03:24:57,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:57,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:57,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:57,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:57,961 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 03:24:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:58,015 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 03:24:58,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:58,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 03:24:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:58,029 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:24:58,029 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 03:24:58,033 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:24:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 03:24:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 03:24:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 03:24:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 03:24:58,083 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 03:24:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:58,084 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 03:24:58,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 03:24:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:24:58,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:58,087 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:58,088 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1075349738, now seen corresponding path program 1 times [2019-10-15 03:24:58,089 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:58,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720792655] [2019-10-15 03:24:58,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:58,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:58,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:24:58,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720792655] [2019-10-15 03:24:58,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539947073] [2019-10-15 03:24:58,178 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:24:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:58,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:24:58,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:24:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:24:58,321 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:24:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:24:58,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:24:58,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 03:24:58,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193893663] [2019-10-15 03:24:58,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:58,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:24:58,380 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 03:24:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:58,393 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 03:24:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:58,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 03:24:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:58,395 INFO L225 Difference]: With dead ends: 33 [2019-10-15 03:24:58,396 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 03:24:58,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:24:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 03:24:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 03:24:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 03:24:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 03:24:58,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 03:24:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:58,404 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 03:24:58,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 03:24:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:24:58,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:58,405 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:58,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:24:58,609 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:58,610 INFO L82 PathProgramCache]: Analyzing trace with hash 447698074, now seen corresponding path program 1 times [2019-10-15 03:24:58,610 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:58,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307772971] [2019-10-15 03:24:58,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:58,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:24:58,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307772971] [2019-10-15 03:24:58,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:58,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:58,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065399036] [2019-10-15 03:24:58,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:58,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:58,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:58,742 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 03:24:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:58,762 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 03:24:58,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:58,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:24:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:58,765 INFO L225 Difference]: With dead ends: 31 [2019-10-15 03:24:58,765 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 03:24:58,766 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:24:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 03:24:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 03:24:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 03:24:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 03:24:58,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 03:24:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:58,781 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 03:24:58,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 03:24:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:24:58,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:58,784 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:58,785 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:58,785 INFO L82 PathProgramCache]: Analyzing trace with hash -69054062, now seen corresponding path program 1 times [2019-10-15 03:24:58,786 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:58,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022682103] [2019-10-15 03:24:58,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:58,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:58,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:24:58,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022682103] [2019-10-15 03:24:58,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046457188] [2019-10-15 03:24:58,924 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:24:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:59,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:24:59,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:24:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:24:59,042 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:24:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:24:59,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1818411622] [2019-10-15 03:24:59,097 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:24:59,097 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:24:59,103 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:24:59,111 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:24:59,112 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:24:59,246 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:01,250 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-15 03:25:01,290 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:01,294 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:01,737 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:01,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 03:25:01,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713374904] [2019-10-15 03:25:01,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 03:25:01,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 03:25:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:25:01,740 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 03:25:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:02,382 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 03:25:02,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:25:02,383 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 03:25:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:02,384 INFO L225 Difference]: With dead ends: 40 [2019-10-15 03:25:02,384 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 03:25:02,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-15 03:25:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 03:25:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 03:25:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:25:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 03:25:02,391 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 03:25:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:02,392 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 03:25:02,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 03:25:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 03:25:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 03:25:02,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:02,393 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:02,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:02,613 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash -493974743, now seen corresponding path program 2 times [2019-10-15 03:25:02,614 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:02,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398659693] [2019-10-15 03:25:02,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:02,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:02,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:02,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398659693] [2019-10-15 03:25:02,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239229315] [2019-10-15 03:25:02,723 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 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:25:02,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 03:25:02,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:02,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:25:02,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:25:02,834 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:25:02,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064261229] [2019-10-15 03:25:02,872 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:02,877 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:02,878 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:02,878 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:02,879 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:02,916 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:04,443 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-15 03:25:04,474 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:04,478 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:04,947 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:04,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 03:25:04,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619452316] [2019-10-15 03:25:04,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 03:25:04,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:04,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 03:25:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:25:04,950 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 03:25:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:05,830 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 03:25:05,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:25:05,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 03:25:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:05,831 INFO L225 Difference]: With dead ends: 44 [2019-10-15 03:25:05,831 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 03:25:05,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 03:25:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 03:25:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 03:25:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:25:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 03:25:05,839 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 03:25:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:05,840 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 03:25:05,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 03:25:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 03:25:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:25:05,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:05,841 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:06,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:06,057 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash 132820922, now seen corresponding path program 3 times [2019-10-15 03:25:06,058 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:06,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138855640] [2019-10-15 03:25:06,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:06,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:06,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 03:25:06,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138855640] [2019-10-15 03:25:06,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30551621] [2019-10-15 03:25:06,186 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 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-10-15 03:25:06,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:25:06,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:06,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:25:06,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 03:25:06,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 03:25:06,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1043337929] [2019-10-15 03:25:06,422 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:06,422 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:06,423 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:06,423 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:06,423 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:06,446 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:07,910 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-15 03:25:07,941 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:07,945 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:08,427 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:08,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-15 03:25:08,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545880191] [2019-10-15 03:25:08,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 03:25:08,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 03:25:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-10-15 03:25:08,430 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 24 states. [2019-10-15 03:25:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:09,399 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2019-10-15 03:25:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:25:09,400 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-10-15 03:25:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:09,401 INFO L225 Difference]: With dead ends: 52 [2019-10-15 03:25:09,402 INFO L226 Difference]: Without dead ends: 35 [2019-10-15 03:25:09,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2019-10-15 03:25:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-15 03:25:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-15 03:25:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:25:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-15 03:25:09,410 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 42 [2019-10-15 03:25:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:09,410 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-15 03:25:09,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-15 03:25:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-15 03:25:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:25:09,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:09,413 INFO L380 BasicCegarLoop]: trace histogram [30, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:09,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:09,617 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash 238611642, now seen corresponding path program 4 times [2019-10-15 03:25:09,618 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:09,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300278151] [2019-10-15 03:25:09,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:09,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:09,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-10-15 03:25:09,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300278151] [2019-10-15 03:25:09,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484516514] [2019-10-15 03:25:09,779 INFO L92 rtionOrderModulation]: Changing assertion order to 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-10-15 03:25:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:09,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:25:09,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-10-15 03:25:09,981 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-10-15 03:25:10,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1082111272] [2019-10-15 03:25:10,050 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:10,050 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:10,050 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:10,051 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:10,051 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:10,067 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:11,383 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-15 03:25:11,401 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:11,403 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:11,756 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:11,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8, 11] total 24 [2019-10-15 03:25:11,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188586255] [2019-10-15 03:25:11,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 03:25:11,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:11,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 03:25:11,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:25:11,759 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 25 states. [2019-10-15 03:25:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:16,806 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2019-10-15 03:25:16,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 03:25:16,806 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2019-10-15 03:25:16,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:16,807 INFO L225 Difference]: With dead ends: 65 [2019-10-15 03:25:16,807 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:25:16,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=298, Invalid=1681, Unknown=1, NotChecked=0, Total=1980 [2019-10-15 03:25:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:25:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-15 03:25:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 03:25:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-15 03:25:16,816 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 60 [2019-10-15 03:25:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:16,817 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-15 03:25:16,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 03:25:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-15 03:25:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-15 03:25:16,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:16,819 INFO L380 BasicCegarLoop]: trace histogram [30, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:17,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:17,025 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash -24325491, now seen corresponding path program 5 times [2019-10-15 03:25:17,025 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:17,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511522211] [2019-10-15 03:25:17,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:17,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:17,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-15 03:25:17,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511522211] [2019-10-15 03:25:17,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771179303] [2019-10-15 03:25:17,177 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 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-10-15 03:25:17,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 03:25:17,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:17,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 03:25:17,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 246 proven. 3 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-15 03:25:17,362 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-15 03:25:17,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021553270] [2019-10-15 03:25:17,393 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:17,393 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:17,393 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:17,394 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:17,394 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:17,408 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:18,572 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-15 03:25:18,594 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:18,596 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:18,880 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:18,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-15 03:25:18,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232682337] [2019-10-15 03:25:18,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-15 03:25:18,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:18,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-15 03:25:18,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:25:18,883 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 20 states. [2019-10-15 03:25:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:19,542 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-10-15 03:25:19,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:25:19,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-10-15 03:25:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:19,544 INFO L225 Difference]: With dead ends: 63 [2019-10-15 03:25:19,544 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:25:19,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:25:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:25:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-15 03:25:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-15 03:25:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-15 03:25:19,554 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 66 [2019-10-15 03:25:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:19,555 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-15 03:25:19,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-15 03:25:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-15 03:25:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 03:25:19,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:19,556 INFO L380 BasicCegarLoop]: trace histogram [30, 10, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:19,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:19,760 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1814718451, now seen corresponding path program 6 times [2019-10-15 03:25:19,761 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:19,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793391091] [2019-10-15 03:25:19,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:19,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:19,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-15 03:25:19,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793391091] [2019-10-15 03:25:19,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66928123] [2019-10-15 03:25:19,981 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 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-10-15 03:25:20,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:25:20,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:20,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 03:25:20,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 246 proven. 21 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-15 03:25:20,216 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-15 03:25:20,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1440081260] [2019-10-15 03:25:20,285 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:20,285 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:20,286 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:20,286 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:20,286 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:20,299 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:21,377 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-15 03:25:21,398 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:21,400 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:21,718 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:21,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 22 [2019-10-15 03:25:21,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80132679] [2019-10-15 03:25:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-15 03:25:21,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-15 03:25:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-15 03:25:21,721 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 23 states. [2019-10-15 03:25:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:22,600 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-10-15 03:25:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:25:22,601 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2019-10-15 03:25:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:22,603 INFO L225 Difference]: With dead ends: 66 [2019-10-15 03:25:22,603 INFO L226 Difference]: Without dead ends: 48 [2019-10-15 03:25:22,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 193 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 03:25:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-15 03:25:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-15 03:25:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-15 03:25:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-15 03:25:22,611 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 70 [2019-10-15 03:25:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:22,612 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-15 03:25:22,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-15 03:25:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-15 03:25:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:25:22,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:22,613 INFO L380 BasicCegarLoop]: trace histogram [30, 10, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:22,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:22,818 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1614484445, now seen corresponding path program 7 times [2019-10-15 03:25:22,819 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:22,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423182042] [2019-10-15 03:25:22,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:22,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:22,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY