java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-old.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-23 18:12:29,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 18:12:29,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 18:12:29,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 18:12:29,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 18:12:29,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 18:12:29,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 18:12:29,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 18:12:29,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 18:12:29,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 18:12:29,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 18:12:29,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 18:12:29,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 18:12:29,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 18:12:29,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 18:12:29,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 18:12:29,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 18:12:29,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 18:12:29,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 18:12:29,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 18:12:29,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 18:12:29,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 18:12:29,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 18:12:29,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 18:12:29,210 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 18:12:29,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 18:12:29,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 18:12:29,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 18:12:29,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 18:12:29,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 18:12:29,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 18:12:29,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 18:12:29,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 18:12:29,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 18:12:29,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 18:12:29,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 18:12:29,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-old.epf [2018-07-23 18:12:29,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 18:12:29,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 18:12:29,246 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-23 18:12:29,246 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-23 18:12:29,246 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-23 18:12:29,247 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-23 18:12:29,247 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-23 18:12:29,247 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-23 18:12:29,247 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-23 18:12:29,247 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-23 18:12:29,248 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-23 18:12:29,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-23 18:12:29,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-23 18:12:29,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-23 18:12:29,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-23 18:12:29,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-23 18:12:29,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-23 18:12:29,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-23 18:12:29,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-23 18:12:29,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 18:12:29,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-23 18:12:29,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-23 18:12:29,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-23 18:12:29,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-23 18:12:29,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 18:12:29,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-23 18:12:29,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-23 18:12:29,251 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-07-23 18:12:29,251 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-23 18:12:29,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-23 18:12:29,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 18:12:29,252 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-23 18:12:29,252 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-23 18:12:29,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 18:12:29,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 18:12:29,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 18:12:29,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-23 18:12:29,334 INFO L276 PluginConnector]: CDTParser initialized [2018-07-23 18:12:29,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-07-23 18:12:29,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2920cf343/688f902d15c94b77a24e8b366a0cc039/FLAGbf5ce99c8 [2018-07-23 18:12:29,830 INFO L276 CDTParser]: Found 1 translation units. [2018-07-23 18:12:29,831 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-07-23 18:12:29,837 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2920cf343/688f902d15c94b77a24e8b366a0cc039/FLAGbf5ce99c8 [2018-07-23 18:12:29,850 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2920cf343/688f902d15c94b77a24e8b366a0cc039 [2018-07-23 18:12:29,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 18:12:29,863 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-23 18:12:29,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-23 18:12:29,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-23 18:12:29,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-23 18:12:29,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:12:29" (1/1) ... [2018-07-23 18:12:29,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f3b58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:29, skipping insertion in model container [2018-07-23 18:12:29,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:12:29" (1/1) ... [2018-07-23 18:12:30,039 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-23 18:12:30,088 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 18:12:30,102 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-23 18:12:30,114 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-23 18:12:30,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30 WrapperNode [2018-07-23 18:12:30,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-23 18:12:30,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-23 18:12:30,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-23 18:12:30,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-23 18:12:30,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-23 18:12:30,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 18:12:30,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 18:12:30,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 18:12:30,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (1/1) ... [2018-07-23 18:12:30,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 18:12:30,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 18:12:30,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 18:12:30,180 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 18:12:30,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (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 [2018-07-23 18:12:30,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-23 18:12:30,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-23 18:12:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 18:12:30,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 18:12:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 18:12:30,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 18:12:30,242 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assert [2018-07-23 18:12:30,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assert [2018-07-23 18:12:30,747 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 18:12:30,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:12:30 BoogieIcfgContainer [2018-07-23 18:12:30,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 18:12:30,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 18:12:30,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 18:12:30,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 18:12:30,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:12:29" (1/3) ... [2018-07-23 18:12:30,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efa02de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:12:30, skipping insertion in model container [2018-07-23 18:12:30,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:12:30" (2/3) ... [2018-07-23 18:12:30,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efa02de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:12:30, skipping insertion in model container [2018-07-23 18:12:30,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:12:30" (3/3) ... [2018-07-23 18:12:30,756 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-07-23 18:12:30,765 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-23 18:12:30,777 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 18:12:30,818 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 18:12:30,818 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 18:12:30,819 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 18:12:30,819 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-23 18:12:30,819 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 18:12:30,819 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 18:12:30,819 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 18:12:30,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 18:12:30,819 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 18:12:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-07-23 18:12:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 18:12:30,840 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:12:30,841 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:12:30,841 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:12:30,847 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-07-23 18:12:30,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:12:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:30,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:30,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:12:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:30,959 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 18:12:30,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 18:12:30,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 18:12:30,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-23 18:12:30,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-23 18:12:30,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-23 18:12:30,978 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-07-23 18:12:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:12:30,999 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-07-23 18:12:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-23 18:12:31,000 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-07-23 18:12:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:12:31,008 INFO L225 Difference]: With dead ends: 39 [2018-07-23 18:12:31,008 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 18:12:31,012 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-23 18:12:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 18:12:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 18:12:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 18:12:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-07-23 18:12:31,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-07-23 18:12:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:12:31,050 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-07-23 18:12:31,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-23 18:12:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-07-23 18:12:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 18:12:31,052 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:12:31,052 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:12:31,052 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:12:31,053 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-07-23 18:12:31,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:12:31,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:31,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:31,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:31,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:12:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:31,214 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 18:12:31,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 18:12:31,214 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 18:12:31,216 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 18:12:31,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 18:12:31,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 18:12:31,219 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-07-23 18:12:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:12:31,587 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-07-23 18:12:31,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 18:12:31,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-07-23 18:12:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:12:31,590 INFO L225 Difference]: With dead ends: 30 [2018-07-23 18:12:31,591 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 18:12:31,592 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 18:12:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 18:12:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-07-23 18:12:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 18:12:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-07-23 18:12:31,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-07-23 18:12:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:12:31,599 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-07-23 18:12:31,600 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 18:12:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-07-23 18:12:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 18:12:31,601 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:12:31,601 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:12:31,601 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:12:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-07-23 18:12:31,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:12:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:31,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:31,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:12:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:33,793 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-07-23 18:12:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:33,798 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 18:12:33,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 18:12:33,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 18:12:33,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 18:12:33,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 18:12:33,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 18:12:33,802 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-07-23 18:12:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:12:34,105 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-07-23 18:12:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 18:12:34,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-07-23 18:12:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:12:34,109 INFO L225 Difference]: With dead ends: 54 [2018-07-23 18:12:34,109 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 18:12:34,109 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 18:12:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 18:12:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-07-23 18:12:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 18:12:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-07-23 18:12:34,116 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-07-23 18:12:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:12:34,116 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-07-23 18:12:34,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 18:12:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-07-23 18:12:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 18:12:34,118 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:12:34,118 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:12:34,118 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:12:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-07-23 18:12:34,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:12:34,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:34,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:34,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:34,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:12:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:34,922 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:12:34,922 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 18:12:34,923 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-07-23 18:12:34,926 INFO L201 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-07-23 18:12:34,973 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-07-23 18:12:34,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-07-23 18:12:35,068 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-07-23 18:12:35,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-07-23 18:12:35,822 INFO L272 AbstractInterpreter]: Visited 22 different actions 133 times. Merged at 13 different actions 89 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-07-23 18:12:35,866 INFO L419 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-07-23 18:12:35,867 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:12:35,867 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 18:12:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:35,882 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-23 18:12:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:35,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:12:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:36,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:12:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:39,217 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:12:39,218 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-23 18:12:39,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:39,236 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-23 18:12:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:39,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:12:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:39,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:12:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:39,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-23 18:12:39,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 24 [2018-07-23 18:12:39,365 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-23 18:12:39,366 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 18:12:39,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 18:12:39,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-07-23 18:12:39,373 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-07-23 18:12:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:12:40,152 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-07-23 18:12:40,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 18:12:40,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-07-23 18:12:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:12:40,155 INFO L225 Difference]: With dead ends: 54 [2018-07-23 18:12:40,155 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 18:12:40,156 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-07-23 18:12:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 18:12:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-07-23 18:12:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 18:12:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-07-23 18:12:40,164 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-07-23 18:12:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:12:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-07-23 18:12:40,164 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 18:12:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-07-23 18:12:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 18:12:40,165 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:12:40,166 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:12:40,166 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:12:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-07-23 18:12:40,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:12:40,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:40,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:40,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:40,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:12:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:40,371 WARN L169 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-07-23 18:12:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:12:40,373 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 18:12:40,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 18:12:40,374 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-23 18:12:40,374 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 18:12:40,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 18:12:40,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 18:12:40,375 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-07-23 18:12:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:12:40,463 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-07-23 18:12:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 18:12:40,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-07-23 18:12:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:12:40,465 INFO L225 Difference]: With dead ends: 66 [2018-07-23 18:12:40,465 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 18:12:40,465 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 18:12:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 18:12:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-07-23 18:12:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 18:12:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-07-23 18:12:40,472 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-07-23 18:12:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:12:40,472 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-07-23 18:12:40,473 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 18:12:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-07-23 18:12:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 18:12:40,474 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:12:40,474 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:12:40,474 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:12:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-07-23 18:12:40,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:12:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:40,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:12:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:12:40,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:12:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:12:40,860 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 5 [2018-07-23 18:12:41,040 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-07-23 18:12:43,055 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-07-23 18:12:45,098 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-07-23 18:12:47,111 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-07-23 18:12:49,126 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-07-23 18:12:51,162 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-07-23 18:13:01,365 WARN L169 SmtUtils]: Spent 10.17 s on a formula simplification. DAG size of input: 60 DAG size of output: 20 [2018-07-23 18:13:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-07-23 18:13:01,391 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:01,391 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 18:13:01,391 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-07-23 18:13:01,392 INFO L201 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [25], [31], [37], [43], [49], [55], [61], [67], [73], [80], [83], [85], [91], [92], [93], [95] [2018-07-23 18:13:01,394 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-07-23 18:13:01,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-07-23 18:13:01,398 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-07-23 18:13:01,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-07-23 18:13:01,461 INFO L272 AbstractInterpreter]: Visited 22 different actions 25 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-07-23 18:13:01,497 INFO L419 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-07-23 18:13:01,497 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:01,497 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 18:13:01,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:13:01,515 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-23 18:13:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:13:01,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:13:02,004 WARN L169 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-07-23 18:13:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:02,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:13:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:03,260 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:03,260 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-23 18:13:03,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:13:03,276 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-23 18:13:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:13:03,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:13:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:03,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:13:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:03,901 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-23 18:13:03,901 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6, 10, 7] total 22 [2018-07-23 18:13:03,901 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-23 18:13:03,902 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 18:13:03,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 18:13:03,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=228, Unknown=5, NotChecked=170, Total=462 [2018-07-23 18:13:03,903 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 17 states. [2018-07-23 18:13:28,291 WARN L1032 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-07-23 18:13:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:13:30,479 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-07-23 18:13:30,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 18:13:30,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-07-23 18:13:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:13:30,482 INFO L225 Difference]: With dead ends: 67 [2018-07-23 18:13:30,482 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 18:13:30,483 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=67, Invalid=257, Unknown=6, NotChecked=222, Total=552 [2018-07-23 18:13:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 18:13:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 18:13:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 18:13:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-23 18:13:30,488 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-07-23 18:13:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:13:30,488 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-23 18:13:30,488 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 18:13:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-23 18:13:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 18:13:30,489 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:13:30,489 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:13:30,490 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:13:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-07-23 18:13:30,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:13:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:13:30,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-23 18:13:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:13:30,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:13:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:13:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:31,100 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:31,100 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 18:13:31,100 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-07-23 18:13:31,101 INFO L419 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-07-23 18:13:31,101 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:31,101 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 18:13:31,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 18:13:31,111 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-23 18:13:31,131 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 18:13:31,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:13:31,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:13:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:31,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:13:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:45,474 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:45,474 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-23 18:13:45,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-23 18:13:45,493 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-23 18:13:45,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-23 18:13:45,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:13:45,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:13:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:45,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:13:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:45,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-23 18:13:45,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23, 23] total 44 [2018-07-23 18:13:45,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-23 18:13:45,607 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 18:13:45,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 18:13:45,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 18:13:45,608 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-07-23 18:13:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:13:46,055 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-23 18:13:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 18:13:46,055 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-07-23 18:13:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:13:46,057 INFO L225 Difference]: With dead ends: 54 [2018-07-23 18:13:46,057 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 18:13:46,059 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 18:13:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 18:13:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-07-23 18:13:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 18:13:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-23 18:13:46,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-07-23 18:13:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:13:46,066 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-23 18:13:46,067 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 18:13:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-23 18:13:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 18:13:46,068 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:13:46,068 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:13:46,068 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:13:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-07-23 18:13:46,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:13:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:13:46,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 18:13:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:13:46,070 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:13:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:13:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:47,071 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:47,071 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 18:13:47,071 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-07-23 18:13:47,072 INFO L419 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-07-23 18:13:47,072 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:13:47,072 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 18:13:47,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 18:13:47,080 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-23 18:13:47,140 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-23 18:13:47,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:13:47,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:13:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:13:47,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:14:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:09,876 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:14:09,876 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-23 18:14:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-23 18:14:09,892 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-23 18:14:09,980 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-23 18:14:09,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:14:09,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:14:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:10,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:14:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:10,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-23 18:14:10,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33, 33, 33] total 64 [2018-07-23 18:14:10,033 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-23 18:14:10,033 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 18:14:10,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 18:14:10,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 18:14:10,036 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-07-23 18:14:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:14:11,075 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-23 18:14:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 18:14:11,084 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-07-23 18:14:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:14:11,085 INFO L225 Difference]: With dead ends: 66 [2018-07-23 18:14:11,085 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 18:14:11,088 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 18:14:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 18:14:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-07-23 18:14:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 18:14:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-23 18:14:11,094 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-07-23 18:14:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:14:11,095 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-23 18:14:11,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 18:14:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-23 18:14:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 18:14:11,097 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:14:11,097 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:14:11,097 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:14:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-07-23 18:14:11,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:14:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:14:11,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 18:14:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:14:11,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:14:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:14:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:12,720 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:14:12,720 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 18:14:12,720 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-07-23 18:14:12,721 INFO L419 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-07-23 18:14:12,721 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:14:12,721 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 18:14:12,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 18:14:12,740 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-23 18:14:12,799 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 18:14:12,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:14:12,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:14:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:12,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:14:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:38,596 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:14:38,597 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-23 18:14:38,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-23 18:14:38,615 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-23 18:14:38,688 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-23 18:14:38,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:14:38,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:14:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:38,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:14:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:14:38,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-23 18:14:38,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43, 43, 43] total 84 [2018-07-23 18:14:38,786 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-23 18:14:38,786 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 18:14:38,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 18:14:38,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-07-23 18:14:38,790 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-07-23 18:14:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:14:40,577 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-23 18:14:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 18:14:40,578 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-07-23 18:14:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:14:40,580 INFO L225 Difference]: With dead ends: 78 [2018-07-23 18:14:40,580 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 18:14:40,583 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-07-23 18:14:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 18:14:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-07-23 18:14:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 18:14:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-23 18:14:40,590 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-07-23 18:14:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:14:40,590 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-23 18:14:40,590 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 18:14:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-23 18:14:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 18:14:40,591 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 18:14:40,592 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 18:14:40,592 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-23 18:14:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-07-23 18:14:40,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-07-23 18:14:40,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:14:40,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-23 18:14:40,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-23 18:14:40,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-23 18:14:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 18:14:42,919 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-07-23 18:14:44,973 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:14:47,053 WARN L169 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:14:51,120 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:14:51,240 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:14:55,321 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:14:59,399 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:03,483 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:05,655 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:07,815 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:09,903 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:10,225 WARN L169 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:12,341 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:14,531 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:16,820 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:21,193 WARN L169 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:25,306 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:27,415 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:31,539 WARN L169 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:33,657 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:37,782 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:39,912 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:44,040 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:46,181 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:50,315 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:54,470 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:15:56,594 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:00,912 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:03,048 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:05,198 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:07,574 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:09,765 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:13,926 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:16,074 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:18,379 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:20,553 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:22,761 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:26,932 WARN L169 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:29,269 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-07-23 18:16:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:16:29,907 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:16:29,907 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-07-23 18:16:29,908 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-07-23 18:16:29,908 INFO L419 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-07-23 18:16:29,908 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:16:29,908 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-23 18:16:29,915 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 18:16:29,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-23 18:16:30,202 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-23 18:16:30,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:16:30,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:16:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:16:31,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:16:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-07-23 18:16:33,270 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-23 18:16:33,270 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-23 18:16:33,286 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-23 18:16:33,286 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-23 18:16:33,466 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-23 18:16:33,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-23 18:16:33,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-23 18:16:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 18:16:33,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-23 18:16:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 38 proven. 26 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-07-23 18:16:37,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-23 18:16:37,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6, 55, 7] total 69 [2018-07-23 18:16:37,082 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-23 18:16:37,082 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 18:16:37,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 18:16:37,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=4374, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 18:16:37,084 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 64 states. [2018-07-23 18:16:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 18:16:40,461 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-07-23 18:16:40,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 18:16:40,462 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 71 [2018-07-23 18:16:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 18:16:40,463 INFO L225 Difference]: With dead ends: 87 [2018-07-23 18:16:40,463 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 18:16:40,465 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 23 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 115.0s TimeCoverageRelationStatistics Valid=324, Invalid=4506, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 18:16:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 18:16:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 18:16:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 18:16:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 18:16:40,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-07-23 18:16:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 18:16:40,466 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 18:16:40,466 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 18:16:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 18:16:40,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 18:16:40,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 18:16:40,918 WARN L169 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-07-23 18:16:40,922 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-23 18:16:40,922 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-07-23 18:16:40,923 INFO L424 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-07-23 18:16:40,923 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-23 18:16:40,923 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-23 18:16:40,923 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-23 18:16:40,923 INFO L421 ceAbstractionStarter]: For program point L13''(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,923 INFO L421 ceAbstractionStarter]: For program point L19'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,923 INFO L421 ceAbstractionStarter]: For program point L15'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,924 INFO L421 ceAbstractionStarter]: For program point L27'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,924 INFO L421 ceAbstractionStarter]: For program point L23'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,924 INFO L417 ceAbstractionStarter]: At program point L31'(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse1 (+ .cse3 main_~x~0 .cse4)) (.cse0 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-07-23 18:16:40,924 INFO L421 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-07-23 18:16:40,924 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-07-23 18:16:40,924 INFO L424 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-07-23 18:16:40,924 INFO L417 ceAbstractionStarter]: At program point L12''(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-07-23 18:16:40,924 INFO L421 ceAbstractionStarter]: For program point L17'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,924 INFO L421 ceAbstractionStarter]: For program point L29'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point L25'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point L21'(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point L12(lines 12 33) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L424 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-07-23 18:16:40,925 INFO L421 ceAbstractionStarter]: For program point L4''(lines 3 8) no Hoare annotation was computed. [2018-07-23 18:16:40,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 06:16:40 BoogieIcfgContainer [2018-07-23 18:16:40,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 18:16:40,942 INFO L168 Benchmark]: Toolchain (without parser) took 251080.41 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 949.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -259.0 MB). Peak memory consumption was 690.5 MB. Max. memory is 7.1 GB. [2018-07-23 18:16:40,943 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 18:16:40,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 18:16:40,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 18:16:40,945 INFO L168 Benchmark]: Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 18:16:40,945 INFO L168 Benchmark]: RCFGBuilder took 568.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-07-23 18:16:40,946 INFO L168 Benchmark]: TraceAbstraction took 250192.96 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 195.0 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 534.2 MB). Peak memory consumption was 729.2 MB. Max. memory is 7.1 GB. [2018-07-23 18:16:40,951 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 568.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250192.96 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 195.0 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 534.2 MB). Peak memory consumption was 729.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: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 250.1s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 34.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 27 SDslu, 2081 SDs, 0 SdLazy, 7747 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1227 GetRequests, 876 SyntacticMatches, 50 SemanticMatches, 301 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 235.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 211.8s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1323 ConstructedInterpolants, 24 QuantifiedInterpolants, 896585 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 706 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 188/1364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond_true-unreach-call2.i_svcomp-Reach-64bit-Taipan_Default-old.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-23_18-16-40-966.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond_true-unreach-call2.i_svcomp-Reach-64bit-Taipan_Default-old.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_18-16-40-966.csv Received shutdown request...