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.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:04:00,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:04:00,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:04:00,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:04:00,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:04:00,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:04:00,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:04:00,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:04:00,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:04:00,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:04:00,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:04:00,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:04:00,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:04:00,330 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:04:00,331 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:04:00,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:04:00,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:04:00,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:04:00,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:04:00,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:04:00,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:04:00,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:04:00,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:04:00,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:04:00,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:04:00,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:04:00,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:04:00,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:04:00,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:04:00,367 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:04:00,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:04:00,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:04:00,368 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:04:00,368 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:04:00,369 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:04:00,369 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:04:00,370 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:04:00,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:04:00,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:04:00,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:04:00,401 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:04:00,401 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:04:00,401 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:04:00,401 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:04:00,401 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:04:00,402 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:04:00,402 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:04:00,402 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:04:00,402 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:04:00,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:04:00,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:04:00,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:04:00,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:04:00,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:04:00,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:04:00,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:04:00,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:04:00,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:04:00,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:04:00,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:04:00,405 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:04:00,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:04:00,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:04:00,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:04:00,406 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:04:00,406 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:04:00,407 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:04:00,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:04:00,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:04:00,407 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:04:00,407 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:04:00,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:04:00,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:04:00,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:04:00,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:04:00,488 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:04:00,488 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-07 05:04:00,555 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee24a414/fd4bbd5ed33e466db3a70686ffdb02c5/FLAG3456f4830 [2018-11-07 05:04:01,049 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:04:01,050 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-07 05:04:01,056 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee24a414/fd4bbd5ed33e466db3a70686ffdb02c5/FLAG3456f4830 [2018-11-07 05:04:01,070 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee24a414/fd4bbd5ed33e466db3a70686ffdb02c5 [2018-11-07 05:04:01,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:04:01,083 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:04:01,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:04:01,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:04:01,087 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:04:01,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6698ba59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01, skipping insertion in model container [2018-11-07 05:04:01,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:04:01,122 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:04:01,355 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:04:01,359 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:04:01,394 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:04:01,420 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:04:01,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01 WrapperNode [2018-11-07 05:04:01,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:04:01,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:04:01,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:04:01,422 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:04:01,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:04:01,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:04:01,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:04:01,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:04:01,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (1/1) ... [2018-11-07 05:04:01,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:04:01,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:04:01,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:04:01,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:04:01,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (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-07 05:04:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:04:01,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:04:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 05:04:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:04:01,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:04:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:04:01,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:04:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 05:04:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:04:01,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:04:01,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 05:04:02,089 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:04:02,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:02 BoogieIcfgContainer [2018-11-07 05:04:02,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:04:02,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:04:02,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:04:02,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:04:02,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:04:01" (1/3) ... [2018-11-07 05:04:02,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ad2b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:02, skipping insertion in model container [2018-11-07 05:04:02,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:01" (2/3) ... [2018-11-07 05:04:02,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ad2b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:02, skipping insertion in model container [2018-11-07 05:04:02,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:02" (3/3) ... [2018-11-07 05:04:02,099 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-07 05:04:02,109 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:04:02,117 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:04:02,135 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:04:02,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:04:02,171 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:04:02,171 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:04:02,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:04:02,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:04:02,171 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:04:02,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:04:02,172 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:04:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-07 05:04:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 05:04:02,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:02,199 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:02,201 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:02,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1232552056, now seen corresponding path program 1 times [2018-11-07 05:04:02,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:02,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:02,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:02,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:02,526 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-07 05:04:02,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:02,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:04:02,530 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:02,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:04:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:04:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:04:02,554 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-11-07 05:04:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:02,969 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2018-11-07 05:04:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:04:02,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-07 05:04:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:02,983 INFO L225 Difference]: With dead ends: 78 [2018-11-07 05:04:02,983 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 05:04:02,992 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:04:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 05:04:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-11-07 05:04:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 05:04:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-07 05:04:03,055 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2018-11-07 05:04:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:03,056 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-07 05:04:03,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:04:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-07 05:04:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:04:03,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:03,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:03,059 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:03,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -814446705, now seen corresponding path program 1 times [2018-11-07 05:04:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:03,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:03,148 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-07 05:04:03,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:03,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:04:03,148 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:03,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:04:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:04:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:04:03,151 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-11-07 05:04:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:03,169 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-07 05:04:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:04:03,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-07 05:04:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:03,171 INFO L225 Difference]: With dead ends: 49 [2018-11-07 05:04:03,171 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 05:04:03,172 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-07 05:04:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 05:04:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-07 05:04:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 05:04:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 05:04:03,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 18 [2018-11-07 05:04:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:03,180 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 05:04:03,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:04:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 05:04:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 05:04:03,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:03,182 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:03,182 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:03,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2030890370, now seen corresponding path program 1 times [2018-11-07 05:04:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:03,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:03,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:03,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:03,592 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:03,593 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 05:04:03,595 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [16], [18], [19], [20], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66] [2018-11-07 05:04:03,646 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:04:03,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:04:03,794 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:04:04,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:04:04,019 INFO L272 AbstractInterpreter]: Visited 19 different actions 31 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-11-07 05:04:04,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:04,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:04:04,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:04,059 INFO L194 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-07 05:04:04,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:04,076 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:04,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:04,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:04,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 05:04:04,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 17 [2018-11-07 05:04:04,956 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:04,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:04:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:04:04,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:04:04,958 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2018-11-07 05:04:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:07,542 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-07 05:04:07,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:04:07,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-07 05:04:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:07,546 INFO L225 Difference]: With dead ends: 54 [2018-11-07 05:04:07,547 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 05:04:07,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:04:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 05:04:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2018-11-07 05:04:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 05:04:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 05:04:07,556 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 23 [2018-11-07 05:04:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:07,556 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 05:04:07,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:04:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 05:04:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 05:04:07,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:07,558 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:07,558 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:07,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1551069381, now seen corresponding path program 1 times [2018-11-07 05:04:07,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:07,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:07,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:08,224 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2018-11-07 05:04:08,640 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2018-11-07 05:04:09,127 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2018-11-07 05:04:09,277 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-11-07 05:04:09,533 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2018-11-07 05:04:10,141 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-07 05:04:10,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:10,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:10,142 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 05:04:10,142 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [14], [16], [18], [19], [20], [26], [30], [36], [37], [38], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66], [67] [2018-11-07 05:04:10,145 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:04:10,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:04:10,160 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:04:10,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:04:10,319 INFO L272 AbstractInterpreter]: Visited 26 different actions 45 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-07 05:04:10,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:10,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:04:10,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:10,357 INFO L194 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-07 05:04:10,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:10,375 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:10,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:17,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-07 05:04:17,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 05:04:17,874 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:17,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 05:04:17,880 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:17,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2018-11-07 05:04:17,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:04:17,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:17,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:17,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-11-07 05:04:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:18,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:20,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2018-11-07 05:04:20,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:20,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:20,919 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:20,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:20,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:21,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:04:21,025 INFO L303 Elim1Store]: Index analysis took 196 ms [2018-11-07 05:04:21,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 132 [2018-11-07 05:04:21,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 05:04:21,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:21,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:21,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:29 [2018-11-07 05:04:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:21,281 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:04:21,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 11] imperfect sequences [14] total 29 [2018-11-07 05:04:21,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:04:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:04:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=670, Unknown=3, NotChecked=0, Total=812 [2018-11-07 05:04:21,283 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 13 states. [2018-11-07 05:04:33,557 WARN L179 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-07 05:04:41,163 WARN L179 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-11-07 05:04:46,400 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-11-07 05:04:56,002 WARN L179 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-11-07 05:04:59,844 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-07 05:05:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:02,200 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-11-07 05:05:02,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:05:02,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-07 05:05:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:02,202 INFO L225 Difference]: With dead ends: 48 [2018-11-07 05:05:02,202 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:05:02,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=222, Invalid=959, Unknown=9, NotChecked=0, Total=1190 [2018-11-07 05:05:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:05:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:05:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:05:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:05:02,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-07 05:05:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:02,206 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:05:02,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:05:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:05:02,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:05:02,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:05:02,480 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-11-07 05:05:02,793 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2018-11-07 05:05:02,796 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:05:02,796 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:05:02,796 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:05:02,796 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:05:02,796 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:05:02,796 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:05:02,797 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:05:02,797 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-07 05:05:02,797 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-11-07 05:05:02,797 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 37) no Hoare annotation was computed. [2018-11-07 05:05:02,797 INFO L421 ceAbstractionStarter]: At program point L31-3(lines 31 37) the Hoare annotation is: (let ((.cse0 (= |main_~#array~0.offset| 0))) (or (and .cse0 (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (= main_~loop_entered~0 0)) (let ((.cse2 (mod (+ main_~index2~0 1) 4294967296)) (.cse1 (mod (+ main_~index1~0 4294967295) 4294967296))) (and .cse0 (< .cse1 .cse2) (< .cse2 100000) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse3 (+ (* 4 .cse2) |main_~#array~0.offset|)) 4294967296) (mod (select .cse3 (+ (* 4 .cse1) |main_~#array~0.offset|)) 4294967296))))))) [2018-11-07 05:05:02,798 INFO L425 ceAbstractionStarter]: For program point L31-4(lines 20 47) no Hoare annotation was computed. [2018-11-07 05:05:02,798 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2018-11-07 05:05:02,798 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-07 05:05:02,798 INFO L425 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-07 05:05:02,798 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2018-11-07 05:05:02,798 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2018-11-07 05:05:02,799 INFO L421 ceAbstractionStarter]: At program point L40-3(lines 40 44) the Hoare annotation is: (let ((.cse0 (= |main_~#array~0.offset| 0))) (or (let ((.cse1 (mod main_~index2~0 4294967296))) (and .cse0 (< .cse1 100000) (< (mod main_~index1~0 4294967296) .cse1))) (let ((.cse3 (mod (+ main_~index2~0 1) 4294967296)) (.cse2 (mod (+ main_~index1~0 4294967295) 4294967296))) (and .cse0 (< .cse2 .cse3) (< .cse3 100000) (let ((.cse4 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse4 (+ (* 4 .cse3) |main_~#array~0.offset|)) 4294967296) (mod (select .cse4 (+ (* 4 .cse2) |main_~#array~0.offset|)) 4294967296))))))) [2018-11-07 05:05:02,799 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (or (and (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (= main_~loop_entered~0 0)) (and (<= main_~index2~0 (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) 99998)) (exists ((v_prenex_1 Int)) (< (mod v_prenex_1 4294967296) (mod (+ main_~index2~0 1) 4294967296))))) (< (mod main_~index1~0 4294967296) (mod main_~index2~0 4294967296))) [2018-11-07 05:05:02,799 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-07 05:05:02,799 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2018-11-07 05:05:02,799 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-07 05:05:02,800 INFO L425 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-11-07 05:05:02,800 INFO L421 ceAbstractionStarter]: At program point L41-2(line 41) the Hoare annotation is: (let ((.cse0 (mod (+ main_~index2~0 1) 4294967296))) (and (= |main_~#array~0.offset| 0) (< (mod main_~index2~0 4294967296) (mod main_~index1~0 4294967296)) (< (mod (+ main_~index1~0 4294967295) 4294967296) .cse0) (exists ((main_~index1~0 Int)) (let ((.cse2 (mod main_~index1~0 4294967296)) (.cse4 (mod (+ main_~index2~0 1) 4294967296)) (.cse1 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (mod (+ main_~index1~0 4294967295) 4294967296))) (and (= (select .cse1 (+ (* 4 .cse2) |main_~#array~0.offset|)) |main_#t~mem7|) (< (mod main_~index2~0 4294967296) .cse2) (< .cse3 .cse4) (= (mod (select .cse1 (+ (* 4 .cse4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* 4 .cse3) |main_~#array~0.offset|)) 4294967296))))) (< .cse0 100000) (<= |main_#t~mem7| (+ |main_#t~mem8| (* 4294967296 (div (+ (- |main_#t~mem8|) |main_#t~mem7|) 4294967296)))))) [2018-11-07 05:05:02,800 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2018-11-07 05:05:02,800 INFO L425 ceAbstractionStarter]: For program point L41-3(line 41) no Hoare annotation was computed. [2018-11-07 05:05:02,800 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2018-11-07 05:05:02,801 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-07 05:05:02,801 INFO L425 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2018-11-07 05:05:02,801 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2018-11-07 05:05:02,801 INFO L425 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2018-11-07 05:05:02,801 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-11-07 05:05:02,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,810 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,819 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,819 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:05:02 BoogieIcfgContainer [2018-11-07 05:05:02,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:05:02,825 INFO L168 Benchmark]: Toolchain (without parser) took 61742.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -355.7 MB). Peak memory consumption was 407.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:05:02,826 INFO L168 Benchmark]: CDTParser took 0.23 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-07 05:05:02,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.86 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-07 05:05:02,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.76 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-07 05:05:02,828 INFO L168 Benchmark]: Boogie Preprocessor took 55.83 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-07 05:05:02,828 INFO L168 Benchmark]: RCFGBuilder took 579.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-07 05:05:02,829 INFO L168 Benchmark]: TraceAbstraction took 60732.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 453.7 MB). Peak memory consumption was 453.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:05:02,834 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.23 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 337.86 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 32.76 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 55.83 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 579.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60732.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 453.7 MB). Peak memory consumption was 453.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 31]: Loop Invariant [2018-11-07 05:05:02,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((array == 0 && index1 <= 4294967296 * (index1 / 4294967296) + 99999) && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && loop_entered == 0) || (((array == 0 && (index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296) && (index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) - InvariantResult [Line: 40]: Loop Invariant [2018-11-07 05:05:02,845 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,845 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:05:02,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((array == 0 && index2 % 4294967296 < 100000) && index1 % 4294967296 < index2 % 4294967296) || (((array == 0 && (index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296) && (index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 60.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 43.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 84 SDslu, 265 SDs, 0 SdLazy, 255 SolverSat, 24 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 77 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 42.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 306 HoareAnnotationTreeSize, 15 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 176 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 176 ConstructedInterpolants, 10 QuantifiedInterpolants, 72338 SizeOfPredicates, 17 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 23/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...