java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:35:09,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:35:09,325 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:35:09,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:35:09,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:35:09,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:35:09,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:35:09,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:35:09,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:35:09,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:35:09,345 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:35:09,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:35:09,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:35:09,347 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:35:09,348 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:35:09,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:35:09,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:35:09,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:35:09,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:35:09,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:35:09,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:35:09,357 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:35:09,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:35:09,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:35:09,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:35:09,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:35:09,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:35:09,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:35:09,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:35:09,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:35:09,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:35:09,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:35:09,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:35:09,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:35:09,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:35:09,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:35:09,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:35:09,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:35:09,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:35:09,384 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:35:09,384 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:35:09,384 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:35:09,384 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:35:09,384 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:35:09,385 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:35:09,385 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:35:09,385 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:35:09,385 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:35:09,385 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:35:09,386 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:35:09,386 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:35:09,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:35:09,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:35:09,387 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:35:09,387 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:35:09,387 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:35:09,388 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:35:09,388 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:35:09,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:35:09,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:35:09,388 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:35:09,389 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:35:09,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:35:09,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:35:09,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:35:09,389 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:35:09,390 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:35:09,390 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:35:09,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:35:09,390 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:35:09,390 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:35:09,391 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:35:09,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:35:09,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:35:09,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:35:09,472 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:35:09,473 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:35:09,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-11-12 20:35:09,535 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b79606b/232d0787d3574ded9094ad26070719a2/FLAGe2831f9f7 [2018-11-12 20:35:09,978 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:35:09,979 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-11-12 20:35:09,985 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b79606b/232d0787d3574ded9094ad26070719a2/FLAGe2831f9f7 [2018-11-12 20:35:10,001 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b79606b/232d0787d3574ded9094ad26070719a2 [2018-11-12 20:35:10,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:35:10,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:35:10,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:35:10,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:35:10,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:35:10,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8c0ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10, skipping insertion in model container [2018-11-12 20:35:10,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:35:10,059 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:35:10,306 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:35:10,310 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:35:10,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:35:10,351 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:35:10,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10 WrapperNode [2018-11-12 20:35:10,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:35:10,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:35:10,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:35:10,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:35:10,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:35:10,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:35:10,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:35:10,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:35:10,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (1/1) ... [2018-11-12 20:35:10,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:35:10,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:35:10,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:35:10,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:35:10,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (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-11-12 20:35:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:35:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:35:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:35:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:35:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:35:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:35:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:35:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:35:10,816 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:35:10,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:35:10 BoogieIcfgContainer [2018-11-12 20:35:10,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:35:10,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:35:10,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:35:10,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:35:10,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:35:10" (1/3) ... [2018-11-12 20:35:10,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11934989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:35:10, skipping insertion in model container [2018-11-12 20:35:10,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:35:10" (2/3) ... [2018-11-12 20:35:10,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11934989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:35:10, skipping insertion in model container [2018-11-12 20:35:10,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:35:10" (3/3) ... [2018-11-12 20:35:10,839 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2018-11-12 20:35:10,852 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:35:10,863 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:35:10,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:35:10,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:35:10,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:35:10,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:35:10,943 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:35:10,943 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:35:10,943 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:35:10,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:35:10,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:35:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-12 20:35:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:35:10,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:10,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:10,972 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:10,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash -283544510, now seen corresponding path program 1 times [2018-11-12 20:35:10,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:11,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:35:11,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:35:11,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:11,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:35:11,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:35:11,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:35:11,122 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-12 20:35:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:11,145 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-12 20:35:11,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:35:11,147 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:35:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:11,154 INFO L225 Difference]: With dead ends: 37 [2018-11-12 20:35:11,155 INFO L226 Difference]: Without dead ends: 15 [2018-11-12 20:35:11,158 INFO L604 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-11-12 20:35:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-12 20:35:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-12 20:35:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-12 20:35:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-12 20:35:11,192 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-12 20:35:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:11,192 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-12 20:35:11,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:35:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-12 20:35:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:35:11,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:11,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:11,194 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:11,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash -863512858, now seen corresponding path program 1 times [2018-11-12 20:35:11,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:11,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:35:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:35:11,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:11,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:35:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:35:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:35:11,301 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-12 20:35:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:11,321 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-12 20:35:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:35:11,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:35:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:11,324 INFO L225 Difference]: With dead ends: 25 [2018-11-12 20:35:11,324 INFO L226 Difference]: Without dead ends: 20 [2018-11-12 20:35:11,326 INFO L604 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-11-12 20:35:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-12 20:35:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-12 20:35:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-12 20:35:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-12 20:35:11,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-12 20:35:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:11,332 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-12 20:35:11,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:35:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-12 20:35:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:35:11,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:11,333 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:11,333 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:11,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1427803270, now seen corresponding path program 1 times [2018-11-12 20:35:11,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:35:11,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:35:11,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:11,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:35:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:35:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:35:11,405 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-11-12 20:35:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:11,446 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-12 20:35:11,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:35:11,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-12 20:35:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:11,447 INFO L225 Difference]: With dead ends: 29 [2018-11-12 20:35:11,447 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:35:11,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:35:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:35:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:35:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:35:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-12 20:35:11,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-11-12 20:35:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:11,454 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-12 20:35:11,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:35:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-12 20:35:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:35:11,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:11,455 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:11,455 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:11,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179828, now seen corresponding path program 1 times [2018-11-12 20:35:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:11,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:11,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:11,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:11,601 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-12 20:35:11,603 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [22], [24], [28], [34], [37], [39], [45], [46], [47], [49] [2018-11-12 20:35:11,645 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:35:11,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:35:11,794 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:35:12,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:35:12,157 INFO L272 AbstractInterpreter]: Visited 16 different actions 124 times. Merged at 7 different actions 66 times. Widened at 3 different actions 15 times. Performed 328 root evaluator evaluations with a maximum evaluation depth of 6. Performed 328 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 3 different actions. Largest state had 4 variables. [2018-11-12 20:35:12,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:12,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:35:12,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:12,170 INFO L192 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-11-12 20:35:12,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:12,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:12,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:12,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:35:12,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:12,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2018-11-12 20:35:12,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:12,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:35:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:35:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:35:12,544 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 7 states. [2018-11-12 20:35:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:12,774 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-12 20:35:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:35:12,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-12 20:35:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:12,776 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:35:12,776 INFO L226 Difference]: Without dead ends: 37 [2018-11-12 20:35:12,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:35:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-12 20:35:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-11-12 20:35:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:35:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-12 20:35:12,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-11-12 20:35:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:12,786 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-12 20:35:12,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:35:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-12 20:35:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:35:12,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:12,787 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:12,788 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:12,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1070919706, now seen corresponding path program 2 times [2018-11-12 20:35:12,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:12,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:12,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:12,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:35:12,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:12,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:12,896 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:12,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:12,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:12,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:12,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:12,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:12,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:35:12,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:12,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:17,671 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-11-12 20:35:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-12 20:35:23,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-12 20:35:30,530 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:35:30,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [5] total 15 [2018-11-12 20:35:30,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:35:30,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:35:30,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:35:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2018-11-12 20:35:30,532 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-11-12 20:35:34,909 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-12 20:35:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:34,911 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-12 20:35:34,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:35:34,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-12 20:35:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:34,913 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:35:34,913 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:35:34,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=47, Invalid=217, Unknown=8, NotChecked=0, Total=272 [2018-11-12 20:35:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:35:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:35:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:35:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:35:34,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-12 20:35:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:34,916 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:35:34,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:35:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:35:34,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:35:34,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:35:35,125 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-12 20:35:35,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:35:35,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:35:35,125 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:35:35,125 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:35:35,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:35:35,126 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 19) no Hoare annotation was computed. [2018-11-12 20:35:35,126 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 19) no Hoare annotation was computed. [2018-11-12 20:35:35,126 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-11-12 20:35:35,126 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2018-11-12 20:35:35,126 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2018-11-12 20:35:35,126 INFO L425 ceAbstractionStarter]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2018-11-12 20:35:35,127 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 17) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2018-11-12 20:35:35,127 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 17) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2018-11-12 20:35:35,127 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 19) the Hoare annotation is: true [2018-11-12 20:35:35,127 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-12 20:35:35,127 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-12 20:35:35,128 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-12 20:35:35,128 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-12 20:35:35,128 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-12 20:35:35,128 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-12 20:35:35,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:35:35 BoogieIcfgContainer [2018-11-12 20:35:35,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:35:35,153 INFO L168 Benchmark]: Toolchain (without parser) took 25140.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -605.1 MB). Peak memory consumption was 137.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:35:35,154 INFO L168 Benchmark]: CDTParser took 0.24 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-11-12 20:35:35,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.48 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-11-12 20:35:35,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.49 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-11-12 20:35:35,157 INFO L168 Benchmark]: Boogie Preprocessor took 34.59 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-11-12 20:35:35,157 INFO L168 Benchmark]: RCFGBuilder took 406.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:35:35,158 INFO L168 Benchmark]: TraceAbstraction took 24323.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 168.8 MB). Peak memory consumption was 168.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:35:35,163 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.24 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 338.48 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 23.49 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 34.59 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 406.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24323.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 168.8 MB). Peak memory consumption was 168.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x == 0 || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 24.1s OverallTime, 5 OverallIterations, 6 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 21 SDslu, 119 SDs, 0 SdLazy, 71 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 56 HoareAnnotationTreeSize, 12 FomulaSimplifications, 106 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 131 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 169 ConstructedInterpolants, 2 QuantifiedInterpolants, 13521 SizeOfPredicates, 5 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 111/125 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...