/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/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:01:26,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:01:26,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:01:26,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:01:26,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:01:26,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:01:26,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:01:26,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:01:26,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:01:26,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:01:26,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:01:26,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:01:26,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:01:26,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:01:26,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:01:26,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:01:26,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:01:26,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:01:26,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:01:26,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:01:26,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:01:26,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:01:26,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:01:26,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:01:26,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:01:26,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:01:26,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:01:26,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:01:26,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:01:26,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:01:26,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:01:26,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:01:26,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:01:26,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:01:26,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:01:26,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:01:26,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:01:26,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:01:26,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:01:26,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:01:26,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:01:26,422 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:01:26,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:01:26,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:01:26,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:01:26,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:01:26,438 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:01:26,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:01:26,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:01:26,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:01:26,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:01:26,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:01:26,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:01:26,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:01:26,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:01:26,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:01:26,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:01:26,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:01:26,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:01:26,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:01:26,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:01:26,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:01:26,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:01:26,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:26,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:01:26,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:01:26,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:01:26,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:01:26,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:01:26,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:01:26,443 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:01:26,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:01:26,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:01:26,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:01:26,744 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:01:26,745 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:01:26,746 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2019-11-07 04:01:26,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6daa2e2/e89b7b34708e422393be5cbe48c0ff51/FLAGe00a72f64 [2019-11-07 04:01:27,299 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:01:27,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-11-07 04:01:27,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6daa2e2/e89b7b34708e422393be5cbe48c0ff51/FLAGe00a72f64 [2019-11-07 04:01:27,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6daa2e2/e89b7b34708e422393be5cbe48c0ff51 [2019-11-07 04:01:27,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:01:27,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:01:27,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:27,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:01:27,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:01:27,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:27,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b40a1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27, skipping insertion in model container [2019-11-07 04:01:27,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:27,677 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:01:27,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:01:27,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:27,948 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:01:27,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:27,990 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:01:27,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27 WrapperNode [2019-11-07 04:01:27,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:27,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:01:27,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:01:27,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:01:28,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:28,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:28,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:28,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:28,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:28,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:28,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (1/1) ... [2019-11-07 04:01:28,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:01:28,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:01:28,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:01:28,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:01:28,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (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:01:28,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:01:28,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:01:28,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 04:01:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:01:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:01:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:01:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:01:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:01:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:01:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:01:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:01:28,516 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:01:28,516 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-07 04:01:28,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:28 BoogieIcfgContainer [2019-11-07 04:01:28,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:01:28,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:01:28,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:01:28,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:01:28,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:01:27" (1/3) ... [2019-11-07 04:01:28,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f68323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:28, skipping insertion in model container [2019-11-07 04:01:28,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:27" (2/3) ... [2019-11-07 04:01:28,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f68323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:28, skipping insertion in model container [2019-11-07 04:01:28,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:28" (3/3) ... [2019-11-07 04:01:28,526 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-11-07 04:01:28,540 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:01:28,548 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:01:28,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:01:28,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:01:28,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:01:28,584 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:01:28,584 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:01:28,584 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:01:28,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:01:28,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:01:28,585 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:01:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-07 04:01:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 04:01:28,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:28,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:28,612 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2132448607, now seen corresponding path program 1 times [2019-11-07 04:01:28,626 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:28,626 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120546127] [2019-11-07 04:01:28,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:28,838 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:01:28,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120546127] [2019-11-07 04:01:28,840 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:28,840 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:28,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719033829] [2019-11-07 04:01:28,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:28,847 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:28,864 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-11-07 04:01:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:28,991 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-11-07 04:01:28,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:28,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-07 04:01:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:29,003 INFO L225 Difference]: With dead ends: 54 [2019-11-07 04:01:29,003 INFO L226 Difference]: Without dead ends: 26 [2019-11-07 04:01:29,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-07 04:01:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-07 04:01:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-07 04:01:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-07 04:01:29,053 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-11-07 04:01:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:29,054 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-07 04:01:29,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-07 04:01:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:29,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:29,056 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:29,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2119930173, now seen corresponding path program 1 times [2019-11-07 04:01:29,057 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:29,058 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064327140] [2019-11-07 04:01:29,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:29,141 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:01:29,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064327140] [2019-11-07 04:01:29,143 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:29,143 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:01:29,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953079521] [2019-11-07 04:01:29,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:01:29,145 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:01:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:29,146 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-11-07 04:01:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:29,322 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-11-07 04:01:29,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:29,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-07 04:01:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:29,324 INFO L225 Difference]: With dead ends: 37 [2019-11-07 04:01:29,325 INFO L226 Difference]: Without dead ends: 35 [2019-11-07 04:01:29,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:01:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-07 04:01:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-11-07 04:01:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-07 04:01:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-07 04:01:29,342 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2019-11-07 04:01:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:29,342 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-07 04:01:29,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:01:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-07 04:01:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 04:01:29,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:29,344 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:29,345 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:29,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1348120608, now seen corresponding path program 1 times [2019-11-07 04:01:29,346 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:29,346 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616588195] [2019-11-07 04:01:29,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:29,456 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616588195] [2019-11-07 04:01:29,457 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:29,457 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:29,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339664453] [2019-11-07 04:01:29,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:29,458 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:29,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:29,459 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2019-11-07 04:01:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:29,532 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-11-07 04:01:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:29,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-07 04:01:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:29,535 INFO L225 Difference]: With dead ends: 42 [2019-11-07 04:01:29,535 INFO L226 Difference]: Without dead ends: 40 [2019-11-07 04:01:29,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-07 04:01:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-07 04:01:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-07 04:01:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-07 04:01:29,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 19 [2019-11-07 04:01:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:29,547 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-07 04:01:29,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-11-07 04:01:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 04:01:29,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:29,548 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] [2019-11-07 04:01:29,549 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:29,549 INFO L82 PathProgramCache]: Analyzing trace with hash 177302015, now seen corresponding path program 1 times [2019-11-07 04:01:29,550 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:29,550 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658586845] [2019-11-07 04:01:29,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:29,635 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658586845] [2019-11-07 04:01:29,635 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:29,636 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:01:29,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637861743] [2019-11-07 04:01:29,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:01:29,637 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:01:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:29,637 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 7 states. [2019-11-07 04:01:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:29,823 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-11-07 04:01:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:01:29,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-07 04:01:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:29,826 INFO L225 Difference]: With dead ends: 63 [2019-11-07 04:01:29,826 INFO L226 Difference]: Without dead ends: 61 [2019-11-07 04:01:29,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:01:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-07 04:01:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2019-11-07 04:01:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-07 04:01:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-07 04:01:29,839 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 23 [2019-11-07 04:01:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:29,840 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-07 04:01:29,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:01:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-07 04:01:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 04:01:29,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:29,841 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:29,842 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1604066593, now seen corresponding path program 1 times [2019-11-07 04:01:29,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:29,843 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307207667] [2019-11-07 04:01:29,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:29,956 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307207667] [2019-11-07 04:01:29,956 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163785016] [2019-11-07 04:01:29,956 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:01:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:29,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 04:01:30,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:01:30,130 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:01:30,187 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:01:30,187 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-11-07 04:01:30,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344151392] [2019-11-07 04:01:30,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:01:30,188 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:01:30,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:01:30,189 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 7 states. [2019-11-07 04:01:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:31,607 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2019-11-07 04:01:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 04:01:31,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-07 04:01:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:31,610 INFO L225 Difference]: With dead ends: 104 [2019-11-07 04:01:31,610 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 04:01:31,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:01:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 04:01:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-11-07 04:01:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-07 04:01:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-11-07 04:01:31,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-11-07 04:01:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:31,644 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-11-07 04:01:31,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:01:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-11-07 04:01:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 04:01:31,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:31,649 INFO L410 BasicCegarLoop]: trace histogram [3, 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:01:31,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:31,852 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1654338469, now seen corresponding path program 1 times [2019-11-07 04:01:31,853 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:31,853 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827040018] [2019-11-07 04:01:31,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:01:31,953 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827040018] [2019-11-07 04:01:31,953 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465345214] [2019-11-07 04:01:31,953 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:01:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:31,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 04:01:31,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:01:32,031 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:01:32,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1096573574] [2019-11-07 04:01:32,089 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 04:01:32,089 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:32,096 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:32,103 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:32,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:32,165 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:32,860 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:32,868 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:32,870 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:33,151 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-11-07 04:01:33,494 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:33,494 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 13] total 21 [2019-11-07 04:01:33,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444618991] [2019-11-07 04:01:33,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-07 04:01:33,501 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-07 04:01:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-07 04:01:33,502 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 21 states. [2019-11-07 04:01:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:34,877 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2019-11-07 04:01:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-07 04:01:34,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-11-07 04:01:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:34,879 INFO L225 Difference]: With dead ends: 111 [2019-11-07 04:01:34,879 INFO L226 Difference]: Without dead ends: 87 [2019-11-07 04:01:34,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2019-11-07 04:01:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-07 04:01:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2019-11-07 04:01:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-07 04:01:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-11-07 04:01:34,893 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 30 [2019-11-07 04:01:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:34,893 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-11-07 04:01:34,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-07 04:01:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-11-07 04:01:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 04:01:34,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:34,895 INFO L410 BasicCegarLoop]: trace histogram [3, 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:01:35,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:35,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash 488758021, now seen corresponding path program 1 times [2019-11-07 04:01:35,099 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:35,099 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864466626] [2019-11-07 04:01:35,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:01:35,193 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864466626] [2019-11-07 04:01:35,193 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911969137] [2019-11-07 04:01:35,193 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:01:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:35,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-07 04:01:35,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:01:35,315 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:01:35,371 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2002931274] [2019-11-07 04:01:35,373 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 04:01:35,373 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:35,374 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:35,374 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:35,374 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:35,384 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:35,860 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:35,864 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:35,865 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:36,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:36,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 14] total 29 [2019-11-07 04:01:36,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803016959] [2019-11-07 04:01:36,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-07 04:01:36,394 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:36,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-07 04:01:36,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-07 04:01:36,395 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 29 states. [2019-11-07 04:01:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:38,656 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-11-07 04:01:38,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-07 04:01:38,656 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-11-07 04:01:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:38,658 INFO L225 Difference]: With dead ends: 130 [2019-11-07 04:01:38,659 INFO L226 Difference]: Without dead ends: 98 [2019-11-07 04:01:38,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=498, Invalid=2582, Unknown=0, NotChecked=0, Total=3080 [2019-11-07 04:01:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-07 04:01:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 53. [2019-11-07 04:01:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-07 04:01:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-11-07 04:01:38,675 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 32 [2019-11-07 04:01:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:38,676 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-11-07 04:01:38,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-07 04:01:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-11-07 04:01:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 04:01:38,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:38,677 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:38,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:38,888 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash -961518785, now seen corresponding path program 2 times [2019-11-07 04:01:38,889 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:38,889 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88466687] [2019-11-07 04:01:38,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 04:01:38,998 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88466687] [2019-11-07 04:01:38,998 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064601755] [2019-11-07 04:01:38,999 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 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:01:39,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-07 04:01:39,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:01:39,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-07 04:01:39,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 04:01:39,121 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 04:01:39,155 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185867900] [2019-11-07 04:01:39,156 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 04:01:39,157 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:39,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:39,157 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:39,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:39,167 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:39,532 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:39,538 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:39,540 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:39,776 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-11-07 04:01:40,063 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:40,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 13] total 25 [2019-11-07 04:01:40,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344182978] [2019-11-07 04:01:40,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-07 04:01:40,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-07 04:01:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:01:40,065 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 25 states. [2019-11-07 04:01:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:42,005 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2019-11-07 04:01:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-07 04:01:42,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-11-07 04:01:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:42,010 INFO L225 Difference]: With dead ends: 149 [2019-11-07 04:01:42,010 INFO L226 Difference]: Without dead ends: 120 [2019-11-07 04:01:42,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2019-11-07 04:01:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-07 04:01:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2019-11-07 04:01:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-07 04:01:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2019-11-07 04:01:42,033 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 37 [2019-11-07 04:01:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:42,033 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2019-11-07 04:01:42,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-07 04:01:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2019-11-07 04:01:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:01:42,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:42,036 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:42,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:42,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:42,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:42,240 INFO L82 PathProgramCache]: Analyzing trace with hash 953205258, now seen corresponding path program 1 times [2019-11-07 04:01:42,240 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:42,240 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001633238] [2019-11-07 04:01:42,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 04:01:42,388 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001633238] [2019-11-07 04:01:42,388 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264709752] [2019-11-07 04:01:42,388 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:01:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:42,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 04:01:42,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-07 04:01:42,519 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-07 04:01:42,585 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [902927332] [2019-11-07 04:01:42,587 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 04:01:42,587 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:42,587 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:42,588 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:42,588 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:42,596 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:43,194 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:43,199 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:43,200 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:43,759 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:43,759 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6, 13] total 30 [2019-11-07 04:01:43,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387309942] [2019-11-07 04:01:43,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-07 04:01:43,760 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-07 04:01:43,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2019-11-07 04:01:43,763 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 30 states. [2019-11-07 04:01:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:46,382 INFO L93 Difference]: Finished difference Result 214 states and 304 transitions. [2019-11-07 04:01:46,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-07 04:01:46,382 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2019-11-07 04:01:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:46,384 INFO L225 Difference]: With dead ends: 214 [2019-11-07 04:01:46,385 INFO L226 Difference]: Without dead ends: 160 [2019-11-07 04:01:46,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=609, Invalid=3297, Unknown=0, NotChecked=0, Total=3906 [2019-11-07 04:01:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-07 04:01:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 107. [2019-11-07 04:01:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-07 04:01:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2019-11-07 04:01:46,437 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 47 [2019-11-07 04:01:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:46,437 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2019-11-07 04:01:46,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-07 04:01:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2019-11-07 04:01:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:01:46,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:46,440 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:46,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:46,644 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 164211579, now seen corresponding path program 2 times [2019-11-07 04:01:46,645 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:46,645 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530478887] [2019-11-07 04:01:46,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-07 04:01:46,935 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530478887] [2019-11-07 04:01:46,936 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687353123] [2019-11-07 04:01:46,936 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-11-07 04:01:47,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-07 04:01:47,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:01:47,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 04:01:47,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-07 04:01:47,222 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-07 04:01:47,297 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2103918056] [2019-11-07 04:01:47,299 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 04:01:47,299 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:47,299 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:47,299 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:47,300 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:47,306 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:47,806 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:47,813 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:47,814 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:48,945 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:48,946 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 7, 15] total 36 [2019-11-07 04:01:48,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465902366] [2019-11-07 04:01:48,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-07 04:01:48,947 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-07 04:01:48,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2019-11-07 04:01:48,952 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand 36 states. [2019-11-07 04:01:49,258 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-11-07 04:01:51,417 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2019-11-07 04:01:53,020 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-11-07 04:01:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:53,181 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2019-11-07 04:01:53,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-07 04:01:53,181 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 58 [2019-11-07 04:01:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:53,182 INFO L225 Difference]: With dead ends: 269 [2019-11-07 04:01:53,182 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:01:53,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=934, Invalid=4766, Unknown=0, NotChecked=0, Total=5700 [2019-11-07 04:01:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:01:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:01:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:01:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:01:53,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-11-07 04:01:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:53,188 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:01:53,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-07 04:01:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:01:53,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:01:53,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:53,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:01:53,565 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2019-11-07 04:01:53,743 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2019-11-07 04:01:53,985 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 138 [2019-11-07 04:01:54,181 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 114 [2019-11-07 04:01:54,296 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2019-11-07 04:01:54,761 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 18 [2019-11-07 04:01:55,292 WARN L191 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 17 [2019-11-07 04:01:55,854 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 28 [2019-11-07 04:01:56,328 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 17 [2019-11-07 04:01:56,751 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 18 [2019-11-07 04:01:57,087 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 32 [2019-11-07 04:01:57,090 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 04:01:57,090 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:57,090 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:57,090 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 04:01:57,090 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:57,091 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 04:01:57,091 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~n~0 1000000) (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-11-07 04:01:57,091 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~n~0 1000000) (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-11-07 04:01:57,091 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2019-11-07 04:01:57,091 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= 0 main_~i~0) (< main_~k~0 main_~n~0) (< main_~j~0 main_~n~0) (< main_~n~0 1000000) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0))) [2019-11-07 04:01:57,091 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2019-11-07 04:01:57,091 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse2 (< main_~n~0 1000000)) (.cse0 (<= 1 main_~j~0)) (.cse3 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0))) (or (and (<= main_~k~0 2147483647) (<= 0 main_~n~0) .cse0 (<= (div (+ (- main_~n~0) 1) (- 2)) 0) (<= main_~k~0 main_~i~0) .cse1) (and .cse2 (<= 0 (+ main_~n~0 2147483648)) .cse3 .cse1 (= main_~i~0 0)) (and .cse2 (and (<= 0 main_~i~0) (<= 0 main_~k~0) .cse0) .cse3 (<= main_~n~0 main_~j~0) .cse1))) [2019-11-07 04:01:57,091 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-11-07 04:01:57,092 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-11-07 04:01:57,092 INFO L443 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2019-11-07 04:01:57,092 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= 0 main_~n~0)) (.cse1 (* 2 main_~i~0)) (.cse2 (and (<= 1 main_~j~0) (<= main_~n~0 main_~k~0)))) (or (and .cse0 (<= main_~k~0 (+ .cse1 1)) .cse2 (<= main_~i~0 0)) (and (< main_~n~0 1000000) (and .cse0 (<= 0 main_~i~0) (<= .cse1 main_~j~0) (or (and (= main_~n~0 main_~k~0) (< main_~i~0 main_~n~0)) .cse2)) (<= main_~k~0 main_~n~0)))) [2019-11-07 04:01:57,092 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-11-07 04:01:57,092 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2019-11-07 04:01:57,092 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2019-11-07 04:01:57,092 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= 0 main_~i~0) (< main_~n~0 1000000) (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2019-11-07 04:01:57,092 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-07 04:01:57,092 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 04:01:57,092 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 04:01:57,093 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 04:01:57,093 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 04:01:57,093 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 04:01:57,093 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 04:01:57,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:01:57 BoogieIcfgContainer [2019-11-07 04:01:57,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 04:01:57,115 INFO L168 Benchmark]: Toolchain (without parser) took 29456.47 ms. Allocated memory was 137.4 MB in the beginning and 442.0 MB in the end (delta: 304.6 MB). Free memory was 102.0 MB in the beginning and 408.1 MB in the end (delta: -306.1 MB). Peak memory consumption was 303.6 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:57,116 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 04:01:57,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.34 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 92.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:57,118 INFO L168 Benchmark]: Boogie Preprocessor took 128.05 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 179.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:57,118 INFO L168 Benchmark]: RCFGBuilder took 396.72 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 164.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:57,119 INFO L168 Benchmark]: TraceAbstraction took 28592.04 ms. Allocated memory was 200.8 MB in the beginning and 442.0 MB in the end (delta: 241.2 MB). Free memory was 164.0 MB in the beginning and 408.1 MB in the end (delta: -244.1 MB). Peak memory consumption was 302.2 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:57,122 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.34 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 92.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.05 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 179.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 396.72 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 164.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28592.04 ms. Allocated memory was 200.8 MB in the beginning and 442.0 MB in the end (delta: 241.2 MB). Free memory was 164.0 MB in the beginning and 408.1 MB in the end (delta: -244.1 MB). Peak memory consumption was 302.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((0 <= n && k <= 2 * i + 1) && 1 <= j && n <= k) && i <= 0) || ((n < 1000000 && ((0 <= n && 0 <= i) && 2 * i <= j) && ((n == k && i < n) || (1 <= j && n <= k))) && k <= n) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((0 <= i && n < 1000000) && j < n) && 2 * i <= j) && 2 * i <= k) && k <= n - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((k <= 2147483647 && 0 <= n) && 1 <= j) && (-n + 1) / -2 <= 0) && k <= i) && n <= k) || ((((n < 1000000 && 0 <= n + 2147483648) && k <= n) && n <= k) && i == 0)) || ((((n < 1000000 && (0 <= i && 0 <= k) && 1 <= j) && k <= n) && n <= j) && n <= k) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 28.5s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, HoareTripleCheckerStatistics: 195 SDtfs, 522 SDslu, 1067 SDs, 0 SdLazy, 3344 SolverSat, 1089 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 575 SyntacticMatches, 24 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4254 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 212 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 105 PreInvPairs, 237 NumberOfFragments, 226 HoareAnnotationTreeSize, 105 FomulaSimplifications, 229645 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 12 FomulaSimplificationsInter, 101310 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 529 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 736 ConstructedInterpolants, 2 QuantifiedInterpolants, 68548 SizeOfPredicates, 26 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 496/594 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 2789, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 186, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 315, TOOLS_POST_TIME[ms]: 152, TOOLS_POST_CALL_APPLICATIONS: 193, TOOLS_POST_CALL_TIME[ms]: 456, TOOLS_POST_RETURN_APPLICATIONS: 168, TOOLS_POST_RETURN_TIME[ms]: 160, TOOLS_QUANTIFIERELIM_APPLICATIONS: 676, TOOLS_QUANTIFIERELIM_TIME[ms]: 632, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 26, FLUID_QUERY_TIME[ms]: 19, FLUID_QUERIES: 880, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 137, DOMAIN_JOIN_TIME[ms]: 939, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 48, DOMAIN_WIDEN_TIME[ms]: 473, DOMAIN_ISSUBSETEQ_APPLICATIONS: 88, DOMAIN_ISSUBSETEQ_TIME[ms]: 172, DOMAIN_ISBOTTOM_APPLICATIONS: 186, DOMAIN_ISBOTTOM_TIME[ms]: 236, LOOP_SUMMARIZER_APPLICATIONS: 40, LOOP_SUMMARIZER_CACHE_MISSES: 40, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2144, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2142, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 88, CALL_SUMMARIZER_APPLICATIONS: 168, CALL_SUMMARIZER_CACHE_MISSES: 10, CALL_SUMMARIZER_OVERALL_TIME[ms]: 15, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 13, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 8, PATH_EXPR_TIME[ms]: 8, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 38, DAG_COMPRESSION_PROCESSED_NODES: 1159, DAG_COMPRESSION_RETAINED_NODES: 432, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...