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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:21,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:21,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:21,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:21,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:21,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:21,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:21,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:21,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:21,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:21,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:21,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:21,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:21,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:21,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:21,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:21,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:21,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:21,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:21,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:21,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:21,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:21,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:21,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:21,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:21,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:21,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:21,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:21,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:21,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:21,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:21,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:21,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:21,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:21,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:21,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:21,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:21,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:21,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:21,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:21,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:21,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:05:21,589 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:21,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:21,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:21,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:21,591 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:21,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:21,592 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:21,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:21,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:21,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:21,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:21,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:21,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:21,593 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:21,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:21,594 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:21,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:21,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:21,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:21,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:21,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:21,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:21,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:21,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:21,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:21,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:21,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:21,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:21,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:21,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:21,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:21,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:21,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:21,888 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:21,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2019-10-15 01:05:21,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88a841f8/509a132f102c418cb06e8bf4b3c01b97/FLAG7ed148f69 [2019-10-15 01:05:22,428 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:22,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-10-15 01:05:22,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88a841f8/509a132f102c418cb06e8bf4b3c01b97/FLAG7ed148f69 [2019-10-15 01:05:22,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88a841f8/509a132f102c418cb06e8bf4b3c01b97 [2019-10-15 01:05:22,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:22,811 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:22,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:22,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:22,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:22,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:22" (1/1) ... [2019-10-15 01:05:22,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30109f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:22, skipping insertion in model container [2019-10-15 01:05:22,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:22" (1/1) ... [2019-10-15 01:05:22,825 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:22,841 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:23,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:23,021 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:23,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:23,058 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:23,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23 WrapperNode [2019-10-15 01:05:23,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:23,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:23,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:23,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:23,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... [2019-10-15 01:05:23,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:23,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:23,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:23,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:23,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:23,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:23,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:23,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:05:23,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:23,466 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:23,466 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:05:23,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:23 BoogieIcfgContainer [2019-10-15 01:05:23,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:23,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:23,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:23,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:23,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:22" (1/3) ... [2019-10-15 01:05:23,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72468ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:23, skipping insertion in model container [2019-10-15 01:05:23,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:23" (2/3) ... [2019-10-15 01:05:23,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72468ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:23, skipping insertion in model container [2019-10-15 01:05:23,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:23" (3/3) ... [2019-10-15 01:05:23,496 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-10-15 01:05:23,524 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:23,542 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:05:23,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:05:23,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:23,598 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:23,598 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:23,598 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:23,598 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:23,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:23,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:23,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-15 01:05:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:05:23,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:23,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:23,624 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1213508388, now seen corresponding path program 1 times [2019-10-15 01:05:23,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:23,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347089214] [2019-10-15 01:05:23,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:23,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:23,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:23,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347089214] [2019-10-15 01:05:23,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:23,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:23,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483098636] [2019-10-15 01:05:23,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:23,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:23,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:23,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:23,835 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-10-15 01:05:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:23,966 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2019-10-15 01:05:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:23,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-15 01:05:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:23,979 INFO L225 Difference]: With dead ends: 57 [2019-10-15 01:05:23,980 INFO L226 Difference]: Without dead ends: 28 [2019-10-15 01:05:23,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-15 01:05:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-15 01:05:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-15 01:05:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-15 01:05:24,031 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-10-15 01:05:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,032 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-15 01:05:24,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-15 01:05:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:05:24,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,034 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:24,034 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash 542305890, now seen corresponding path program 1 times [2019-10-15 01:05:24,035 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442683318] [2019-10-15 01:05:24,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442683318] [2019-10-15 01:05:24,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:24,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369133391] [2019-10-15 01:05:24,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:24,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:24,109 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-10-15 01:05:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:24,278 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-10-15 01:05:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:24,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-15 01:05:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:24,280 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:05:24,280 INFO L226 Difference]: Without dead ends: 38 [2019-10-15 01:05:24,281 INFO L600 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-10-15 01:05:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-15 01:05:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-10-15 01:05:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-15 01:05:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-15 01:05:24,291 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2019-10-15 01:05:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,292 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-15 01:05:24,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-15 01:05:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:05:24,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,293 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:24,294 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1063580357, now seen corresponding path program 1 times [2019-10-15 01:05:24,294 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243402072] [2019-10-15 01:05:24,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243402072] [2019-10-15 01:05:24,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:24,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302372858] [2019-10-15 01:05:24,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:24,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:24,351 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2019-10-15 01:05:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:24,428 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-10-15 01:05:24,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:24,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-15 01:05:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:24,430 INFO L225 Difference]: With dead ends: 45 [2019-10-15 01:05:24,431 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 01:05:24,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 01:05:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-15 01:05:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 01:05:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-10-15 01:05:24,443 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2019-10-15 01:05:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,444 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-10-15 01:05:24,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-10-15 01:05:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:05:24,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,446 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:24,446 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1462671860, now seen corresponding path program 1 times [2019-10-15 01:05:24,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286213993] [2019-10-15 01:05:24,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286213993] [2019-10-15 01:05:24,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:05:24,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291033289] [2019-10-15 01:05:24,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:24,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:24,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:24,534 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2019-10-15 01:05:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:24,730 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-10-15 01:05:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:05:24,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-15 01:05:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:24,733 INFO L225 Difference]: With dead ends: 68 [2019-10-15 01:05:24,733 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:05:24,734 INFO L600 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-10-15 01:05:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:05:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-15 01:05:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:05:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-10-15 01:05:24,746 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2019-10-15 01:05:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:24,747 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-10-15 01:05:24,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-10-15 01:05:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:05:24,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:24,748 INFO L380 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, 1, 1] [2019-10-15 01:05:24,749 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash -965699220, now seen corresponding path program 1 times [2019-10-15 01:05:24,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:24,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495210651] [2019-10-15 01:05:24,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:24,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495210651] [2019-10-15 01:05:24,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513190560] [2019-10-15 01:05:24,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:05:24,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:05:25,062 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:05:25,123 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:05:25,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-10-15 01:05:25,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297816196] [2019-10-15 01:05:25,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:05:25,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:05:25,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:05:25,126 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 7 states. [2019-10-15 01:05:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:25,723 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2019-10-15 01:05:25,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:05:25,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-15 01:05:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:25,725 INFO L225 Difference]: With dead ends: 111 [2019-10-15 01:05:25,725 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 01:05:25,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:05:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 01:05:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2019-10-15 01:05:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:05:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-15 01:05:25,737 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 27 [2019-10-15 01:05:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:25,738 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-15 01:05:25,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:05:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-15 01:05:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:05:25,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:25,739 INFO L380 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, 1] [2019-10-15 01:05:25,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:25,954 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:25,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:25,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1830678608, now seen corresponding path program 1 times [2019-10-15 01:05:25,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:25,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081029408] [2019-10-15 01:05:25,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:25,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:25,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:05:26,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081029408] [2019-10-15 01:05:26,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132151300] [2019-10-15 01:05:26,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:26,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:05:26,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:05:26,122 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:05:26,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2134270570] [2019-10-15 01:05:26,162 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-10-15 01:05:26,192 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:26,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:26,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:26,388 INFO L272 AbstractInterpreter]: Visited 26 different actions 140 times. Merged at 9 different actions 33 times. Widened at 2 different actions 3 times. Performed 202 root evaluator evaluations with a maximum evaluation depth of 5. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 6 fixpoints after 3 different actions. Largest state had 9 variables. [2019-10-15 01:05:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:26,394 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:26,395 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:26,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2019-10-15 01:05:26,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200383280] [2019-10-15 01:05:26,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:05:26,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:26,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:05:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:05:26,397 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 9 states. [2019-10-15 01:05:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:26,563 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2019-10-15 01:05:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:05:26,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-15 01:05:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:26,566 INFO L225 Difference]: With dead ends: 80 [2019-10-15 01:05:26,566 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 01:05:26,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:05:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 01:05:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-10-15 01:05:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-15 01:05:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-10-15 01:05:26,585 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 31 [2019-10-15 01:05:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:26,586 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-10-15 01:05:26,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:05:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-10-15 01:05:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:05:26,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:26,592 INFO L380 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, 1, 1] [2019-10-15 01:05:26,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:26,793 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:26,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1063418416, now seen corresponding path program 1 times [2019-10-15 01:05:26,795 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:26,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26533789] [2019-10-15 01:05:26,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:26,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:26,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:05:26,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26533789] [2019-10-15 01:05:26,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137705344] [2019-10-15 01:05:26,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:26,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:05:26,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:05:27,067 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:05:27,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1739878752] [2019-10-15 01:05:27,131 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 35 [2019-10-15 01:05:27,134 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:27,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:27,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:27,279 INFO L272 AbstractInterpreter]: Visited 28 different actions 239 times. Merged at 12 different actions 71 times. Widened at 4 different actions 11 times. Performed 375 root evaluator evaluations with a maximum evaluation depth of 5. Performed 375 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 5 different actions. Largest state had 10 variables. [2019-10-15 01:05:27,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:27,280 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:27,280 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:27,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2019-10-15 01:05:27,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883445824] [2019-10-15 01:05:27,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-15 01:05:27,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:27,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-15 01:05:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:05:27,284 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 16 states. [2019-10-15 01:05:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:27,656 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2019-10-15 01:05:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:05:27,656 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-10-15 01:05:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:27,658 INFO L225 Difference]: With dead ends: 120 [2019-10-15 01:05:27,658 INFO L226 Difference]: Without dead ends: 86 [2019-10-15 01:05:27,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:05:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-15 01:05:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2019-10-15 01:05:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-15 01:05:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-10-15 01:05:27,671 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 34 [2019-10-15 01:05:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:27,676 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-10-15 01:05:27,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-15 01:05:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-10-15 01:05:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:05:27,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:27,678 INFO L380 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, 1] [2019-10-15 01:05:27,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:27,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1968312716, now seen corresponding path program 2 times [2019-10-15 01:05:27,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:27,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451452318] [2019-10-15 01:05:27,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:27,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:27,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:05:27,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451452318] [2019-10-15 01:05:27,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127844279] [2019-10-15 01:05:27,980 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-10-15 01:05:28,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-15 01:05:28,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:05:28,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 01:05:28,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:28,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:05:28,060 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:05:28,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1368707226] [2019-10-15 01:05:28,093 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 01:05:28,093 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 01:05:28,094 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:28,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 13 [2019-10-15 01:05:28,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035905651] [2019-10-15 01:05:28,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:05:28,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:28,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:05:28,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:05:28,108 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 13 states. [2019-10-15 01:05:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:28,485 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2019-10-15 01:05:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:05:28,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-10-15 01:05:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:28,487 INFO L225 Difference]: With dead ends: 87 [2019-10-15 01:05:28,488 INFO L226 Difference]: Without dead ends: 85 [2019-10-15 01:05:28,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:05:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-15 01:05:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-10-15 01:05:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-15 01:05:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-10-15 01:05:28,501 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 38 [2019-10-15 01:05:28,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:28,502 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-10-15 01:05:28,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:05:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-10-15 01:05:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:05:28,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:28,504 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-10-15 01:05:28,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:28,707 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:28,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:28,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1795492628, now seen corresponding path program 2 times [2019-10-15 01:05:28,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:28,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940623857] [2019-10-15 01:05:28,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:28,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:28,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:05:28,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940623857] [2019-10-15 01:05:28,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800999193] [2019-10-15 01:05:28,809 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:28,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:05:28,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:05:28,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:05:28,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:05:28,969 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:05:29,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1461438519] [2019-10-15 01:05:29,140 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-15 01:05:29,140 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-15 01:05:29,140 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:29,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2019-10-15 01:05:29,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26417114] [2019-10-15 01:05:29,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-15 01:05:29,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:29,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-15 01:05:29,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:05:29,142 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 21 states. [2019-10-15 01:05:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:33,947 INFO L93 Difference]: Finished difference Result 422 states and 619 transitions. [2019-10-15 01:05:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-15 01:05:33,947 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-10-15 01:05:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:33,951 INFO L225 Difference]: With dead ends: 422 [2019-10-15 01:05:33,951 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:05:33,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1252, Invalid=6758, Unknown=0, NotChecked=0, Total=8010 [2019-10-15 01:05:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:05:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 96. [2019-10-15 01:05:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-15 01:05:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-10-15 01:05:34,015 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 41 [2019-10-15 01:05:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:34,016 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-10-15 01:05:34,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-15 01:05:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2019-10-15 01:05:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:05:34,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:34,020 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:34,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:34,224 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:34,225 INFO L82 PathProgramCache]: Analyzing trace with hash 366127920, now seen corresponding path program 3 times [2019-10-15 01:05:34,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:34,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684477509] [2019-10-15 01:05:34,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:34,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:34,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-15 01:05:34,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684477509] [2019-10-15 01:05:34,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:34,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:34,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670975282] [2019-10-15 01:05:34,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:34,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:34,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:34,278 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand 6 states. [2019-10-15 01:05:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:34,337 INFO L93 Difference]: Finished difference Result 96 states and 129 transitions. [2019-10-15 01:05:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:34,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-10-15 01:05:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:34,338 INFO L225 Difference]: With dead ends: 96 [2019-10-15 01:05:34,338 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:05:34,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:05:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:05:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:05:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:05:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:05:34,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-10-15 01:05:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:34,340 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:05:34,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:05:34,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:05:34,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:05:34,494 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-10-15 01:05:34,610 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2019-10-15 01:05:34,763 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2019-10-15 01:05:34,959 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-10-15 01:05:35,224 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 13 [2019-10-15 01:05:35,690 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 14 [2019-10-15 01:05:35,962 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 34 [2019-10-15 01:05:36,133 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 12 [2019-10-15 01:05:36,348 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 13 [2019-10-15 01:05:36,440 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:05:36,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:36,440 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:36,440 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:05:36,440 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:36,441 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:36,441 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (< 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-10-15 01:05:36,441 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (< 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-10-15 01:05:36,441 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2019-10-15 01:05:36,441 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))) [2019-10-15 01:05:36,441 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2019-10-15 01:05:36,441 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-10-15 01:05:36,441 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse1 (<= main_~k~0 main_~n~0)) (.cse0 (<= main_~n~0 main_~k~0)) (.cse2 (<= main_~n~0 main_~j~0))) (or (and .cse0 .cse1 (<= main_~i~0 0)) (and .cse1 .cse0 .cse2) (let ((.cse3 (div (+ (- main_~n~0) 1) (- 2)))) (and (<= .cse3 0) (<= (+ .cse3 1) main_~i~0) (<= main_~k~0 main_~i~0) .cse0 .cse2)) (and (<= main_~j~0 (* 2 main_~i~0)) .cse0 .cse2))) [2019-10-15 01:05:36,441 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-10-15 01:05:36,442 INFO L443 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-10-15 01:05:36,442 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-10-15 01:05:36,442 INFO L443 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2019-10-15 01:05:36,442 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0))) (let ((.cse0 (and (<= .cse1 main_~j~0) (<= main_~n~0 main_~k~0)))) (or (and (<= (* 2 main_~k~0) (+ main_~j~0 main_~n~0 1)) .cse0 (forall ((main_~n~0 Int)) (or (< (div (* main_~n~0 (- 1)) (- 2)) (+ main_~i~0 2)) (< main_~j~0 main_~n~0)))) (and .cse0 (<= main_~j~0 .cse1) (<= main_~n~0 main_~j~0)) (and (<= main_~k~0 (+ .cse1 1)) .cse0 (<= main_~i~0 0)) (and (<= main_~k~0 main_~n~0) .cse0)))) [2019-10-15 01:05:36,442 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-10-15 01:05:36,442 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2019-10-15 01:05:36,442 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2019-10-15 01:05:36,442 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2019-10-15 01:05:36,443 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-10-15 01:05:36,443 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-15 01:05:36,443 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:05:36,443 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-15 01:05:36,443 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-15 01:05:36,443 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-15 01:05:36,444 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:05:36,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-10-15 01:05:36,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-10-15 01:05:36,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-10-15 01:05:36,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-10-15 01:05:36,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:36 BoogieIcfgContainer [2019-10-15 01:05:36,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:05:36,461 INFO L168 Benchmark]: Toolchain (without parser) took 13650.57 ms. Allocated memory was 142.6 MB in the beginning and 317.2 MB in the end (delta: 174.6 MB). Free memory was 98.9 MB in the beginning and 150.6 MB in the end (delta: -51.7 MB). Peak memory consumption was 187.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:36,462 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:05:36,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.72 ms. Allocated memory is still 142.6 MB. Free memory was 98.7 MB in the beginning and 89.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:36,464 INFO L168 Benchmark]: Boogie Preprocessor took 116.16 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 89.2 MB in the beginning and 178.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:36,465 INFO L168 Benchmark]: RCFGBuilder took 292.91 ms. Allocated memory is still 200.3 MB. Free memory was 178.6 MB in the beginning and 165.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:36,466 INFO L168 Benchmark]: TraceAbstraction took 12989.30 ms. Allocated memory was 200.3 MB in the beginning and 317.2 MB in the end (delta: 116.9 MB). Free memory was 165.2 MB in the beginning and 150.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 195.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:36,470 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.20 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.72 ms. Allocated memory is still 142.6 MB. Free memory was 98.7 MB in the beginning and 89.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.16 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 89.2 MB in the beginning and 178.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 292.91 ms. Allocated memory is still 200.3 MB. Free memory was 178.6 MB in the beginning and 165.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12989.30 ms. Allocated memory was 200.3 MB in the beginning and 317.2 MB in the end (delta: 116.9 MB). Free memory was 165.2 MB in the beginning and 150.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 195.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] * 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 [2019-10-15 01:05:36,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-10-15 01:05:36,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-10-15 01:05:36,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-10-15 01:05:36,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] Derived loop invariant: ((((2 * k <= j + n + 1 && 2 * i <= j && n <= k) && (forall main_~n~0 : int :: main_~n~0 * -1 / -2 < i + 2 || j < main_~n~0)) || (((2 * i <= j && n <= k) && j <= 2 * i) && n <= j)) || ((k <= 2 * i + 1 && 2 * i <= j && n <= k) && i <= 0)) || (k <= n && 2 * i <= j && n <= k) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((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: ((((n <= k && k <= n) && i <= 0) || ((k <= n && n <= k) && n <= j)) || (((((-n + 1) / -2 <= 0 && (-n + 1) / -2 + 1 <= i) && k <= i) && n <= k) && n <= j)) || ((j <= 2 * i && n <= k) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 12.8s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 337 SDtfs, 362 SDslu, 1510 SDs, 0 SdLazy, 2039 SolverSat, 533 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 325 SyntacticMatches, 13 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2829 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred 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, 321 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 54 PreInvPairs, 140 NumberOfFragments, 223 HoareAnnotationTreeSize, 54 FomulaSimplifications, 103793 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 12 FomulaSimplificationsInter, 25412 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 462 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 613 ConstructedInterpolants, 2 QuantifiedInterpolants, 47858 SizeOfPredicates, 24 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 256/307 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...