java -ea -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_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:28:59,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:28:59,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:28:59,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:28:59,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:28:59,500 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:28:59,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:28:59,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:28:59,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:28:59,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:28:59,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:28:59,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:28:59,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:28:59,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:28:59,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:28:59,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:28:59,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:28:59,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:28:59,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:28:59,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:28:59,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:28:59,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:28:59,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:28:59,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:28:59,535 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:28:59,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:28:59,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:28:59,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:28:59,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:28:59,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:28:59,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:28:59,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:28:59,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:28:59,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:28:59,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:28:59,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:28:59,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:28:59,583 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:28:59,583 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:28:59,585 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:28:59,585 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:28:59,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:28:59,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:28:59,586 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:28:59,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:28:59,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:28:59,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:28:59,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:28:59,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:28:59,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:28:59,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:28:59,589 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:28:59,589 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:28:59,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:28:59,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:28:59,590 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:28:59,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:28:59,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:28:59,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:28:59,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:28:59,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:28:59,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:28:59,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:28:59,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:28:59,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:28:59,592 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:28:59,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:28:59,594 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:28:59,594 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:28:59,594 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:28:59,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:28:59,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:28:59,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:28:59,695 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:28:59,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:28:59,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-23 11:28:59,770 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b474503b5/33e23a2cf4164c6db1c303a431ad0034/FLAG2ee3d2caf [2018-11-23 11:29:00,267 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:29:00,268 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-23 11:29:00,273 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b474503b5/33e23a2cf4164c6db1c303a431ad0034/FLAG2ee3d2caf [2018-11-23 11:29:00,612 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b474503b5/33e23a2cf4164c6db1c303a431ad0034 [2018-11-23 11:29:00,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:29:00,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:29:00,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:00,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:29:00,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:29:00,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:00,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d9d738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00, skipping insertion in model container [2018-11-23 11:29:00,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:00,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:29:00,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:29:00,876 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:00,882 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:29:00,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:00,948 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:29:00,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00 WrapperNode [2018-11-23 11:29:00,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:00,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:00,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:29:00,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:29:00,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:00,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:00,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:00,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:29:00,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:29:00,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:29:00,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:00,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:00,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:00,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:01,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:01,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:01,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (1/1) ... [2018-11-23 11:29:01,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:29:01,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:29:01,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:29:01,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:29:01,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (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-23 11:29:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:29:01,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:29:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:29:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:29:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:29:01,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:29:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:29:01,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:29:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:29:01,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:29:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:29:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:29:01,720 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:29:01,721 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:29:01,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:01 BoogieIcfgContainer [2018-11-23 11:29:01,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:29:01,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:29:01,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:29:01,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:29:01,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:00" (1/3) ... [2018-11-23 11:29:01,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2940de90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:01, skipping insertion in model container [2018-11-23 11:29:01,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:00" (2/3) ... [2018-11-23 11:29:01,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2940de90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:01, skipping insertion in model container [2018-11-23 11:29:01,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:01" (3/3) ... [2018-11-23 11:29:01,730 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call1_true-termination.i [2018-11-23 11:29:01,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:29:01,748 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:29:01,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:29:01,800 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:29:01,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:29:01,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:29:01,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:29:01,802 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:29:01,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:29:01,802 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:29:01,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:29:01,803 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:29:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:29:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:29:01,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:01,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:01,832 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:01,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:01,838 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2018-11-23 11:29:01,843 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:01,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:01,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:02,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:29:02,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {24#true} is VALID [2018-11-23 11:29:02,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:29:02,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 11:29:02,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-23 11:29:02,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {24#true} is VALID [2018-11-23 11:29:02,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:29:02,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {25#false} is VALID [2018-11-23 11:29:02,055 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023bv32 == #t~mem1 then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-23 11:29:02,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 11:29:02,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:29:02,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:29:02,060 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-23 11:29:02,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:02,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:02,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:29:02,069 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:29:02,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:02,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:29:02,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:02,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:29:02,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:29:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:29:02,163 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:29:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:02,486 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:29:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:29:02,486 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:29:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:29:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 11:29:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:29:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 11:29:02,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 11:29:02,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:02,717 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:29:02,717 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:29:02,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-23 11:29:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:29:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:29:02,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:02,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:29:02,762 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:29:02,762 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:29:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:02,765 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:29:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:29:02,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:02,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:02,766 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:29:02,766 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:29:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:02,770 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:29:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:29:02,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:02,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:02,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:02,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:29:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 11:29:02,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 11:29:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:02,775 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 11:29:02,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:29:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:29:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:29:02,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:02,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:02,777 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:02,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2018-11-23 11:29:02,778 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:02,778 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:02,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:02,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-23 11:29:02,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {153#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {153#true} is VALID [2018-11-23 11:29:02,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-23 11:29:02,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #35#return; {153#true} is VALID [2018-11-23 11:29:02,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret2 := main(); {153#true} is VALID [2018-11-23 11:29:02,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {173#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:29:02,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {173#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {154#false} is VALID [2018-11-23 11:29:02,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {154#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {154#false} is VALID [2018-11-23 11:29:02,940 INFO L256 TraceCheckUtils]: 8: Hoare triple {154#false} call __VERIFIER_assert((if 1023bv32 == #t~mem1 then 1bv32 else 0bv32)); {154#false} is VALID [2018-11-23 11:29:02,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {154#false} ~cond := #in~cond; {154#false} is VALID [2018-11-23 11:29:02,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {154#false} assume 0bv32 == ~cond; {154#false} is VALID [2018-11-23 11:29:02,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-23 11:29:02,942 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-23 11:29:02,942 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:02,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:02,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:02,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 11:29:02,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:02,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:03,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:03,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:03,031 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-23 11:29:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:03,141 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 11:29:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:03,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 11:29:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 11:29:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 11:29:03,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 11:29:03,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:03,205 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:29:03,205 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:29:03,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-23 11:29:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:29:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 11:29:03,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:03,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 11:29:03,230 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 11:29:03,230 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 11:29:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:03,232 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:29:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:29:03,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:03,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:03,233 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 11:29:03,233 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 11:29:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:03,236 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:29:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:29:03,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:03,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:03,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:03,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:29:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:29:03,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 11:29:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:03,239 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:29:03,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:29:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:29:03,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:03,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:03,241 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:03,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2018-11-23 11:29:03,242 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:03,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:03,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:03,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:29:03,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {278#true} is VALID [2018-11-23 11:29:03,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:29:03,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #35#return; {278#true} is VALID [2018-11-23 11:29:03,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret2 := main(); {278#true} is VALID [2018-11-23 11:29:03,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {298#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:29:03,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {298#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {298#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:29:03,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {298#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {305#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {279#false} is VALID [2018-11-23 11:29:03,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {279#false} is VALID [2018-11-23 11:29:03,424 INFO L256 TraceCheckUtils]: 10: Hoare triple {279#false} call __VERIFIER_assert((if 1023bv32 == #t~mem1 then 1bv32 else 0bv32)); {279#false} is VALID [2018-11-23 11:29:03,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2018-11-23 11:29:03,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {279#false} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:29:03,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:29:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:03,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:03,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:29:03,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {279#false} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:29:03,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2018-11-23 11:29:03,813 INFO L256 TraceCheckUtils]: 10: Hoare triple {279#false} call __VERIFIER_assert((if 1023bv32 == #t~mem1 then 1bv32 else 0bv32)); {279#false} is VALID [2018-11-23 11:29:03,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {279#false} is VALID [2018-11-23 11:29:03,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {339#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {279#false} is VALID [2018-11-23 11:29:03,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {339#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-23 11:29:03,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:03,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:03,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret2 := main(); {278#true} is VALID [2018-11-23 11:29:03,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #35#return; {278#true} is VALID [2018-11-23 11:29:03,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:29:03,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {278#true} is VALID [2018-11-23 11:29:03,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:29:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:03,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:03,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:29:03,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:29:03,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:03,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:29:03,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:03,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:29:03,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:29:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:29:03,879 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-11-23 11:29:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:04,174 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:29:04,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:29:04,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:29:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:29:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:29:04,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 11:29:04,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:04,308 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:29:04,308 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:29:04,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:29:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:29:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:29:04,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:04,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:04,353 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:04,353 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:04,355 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:29:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:29:04,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:04,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:04,356 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:04,356 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:04,359 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:29:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:29:04,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:04,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:04,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:04,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:29:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:29:04,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:29:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:04,362 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:29:04,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:29:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:29:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:29:04,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:04,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:04,364 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:04,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 2 times [2018-11-23 11:29:04,365 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:04,365 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:04,387 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:29:04,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:29:04,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:04,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:04,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 11:29:04,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {483#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {483#true} is VALID [2018-11-23 11:29:04,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 11:29:04,583 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #35#return; {483#true} is VALID [2018-11-23 11:29:04,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret2 := main(); {483#true} is VALID [2018-11-23 11:29:04,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {503#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:29:04,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {503#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:29:04,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {503#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {517#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:29:04,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {517#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:29:04,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {517#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {531#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:29:04,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {531#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {484#false} is VALID [2018-11-23 11:29:04,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {484#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {484#false} is VALID [2018-11-23 11:29:04,603 INFO L256 TraceCheckUtils]: 16: Hoare triple {484#false} call __VERIFIER_assert((if 1023bv32 == #t~mem1 then 1bv32 else 0bv32)); {484#false} is VALID [2018-11-23 11:29:04,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2018-11-23 11:29:04,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {484#false} assume 0bv32 == ~cond; {484#false} is VALID [2018-11-23 11:29:04,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 11:29:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:04,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:05,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 11:29:05,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {484#false} assume 0bv32 == ~cond; {484#false} is VALID [2018-11-23 11:29:05,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2018-11-23 11:29:05,003 INFO L256 TraceCheckUtils]: 16: Hoare triple {484#false} call __VERIFIER_assert((if 1023bv32 == #t~mem1 then 1bv32 else 0bv32)); {484#false} is VALID [2018-11-23 11:29:05,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {484#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {484#false} is VALID [2018-11-23 11:29:05,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {565#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {484#false} is VALID [2018-11-23 11:29:05,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {565#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-23 11:29:05,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:29:05,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret2 := main(); {483#true} is VALID [2018-11-23 11:29:05,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #35#return; {483#true} is VALID [2018-11-23 11:29:05,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 11:29:05,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {483#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {483#true} is VALID [2018-11-23 11:29:05,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 11:29:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:05,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:05,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:29:05,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:29:05,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:05,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:29:05,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:05,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:29:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:29:05,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:29:05,089 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-11-23 11:29:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:05,799 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:29:05,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:29:05,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:29:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 11:29:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 11:29:05,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2018-11-23 11:29:05,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:05,925 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:29:05,925 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:29:05,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:29:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:29:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:29:05,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:05,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:05,968 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:05,968 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:05,972 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:29:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:05,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:05,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:05,973 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:05,973 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:05,979 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:29:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:05,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:05,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:05,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:05,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:29:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 11:29:05,983 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-23 11:29:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:05,983 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 11:29:05,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:29:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:29:05,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:05,985 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:05,985 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:05,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 3 times [2018-11-23 11:29:05,987 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:05,987 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:06,009 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:29:06,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:29:06,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:06,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:06,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-11-23 11:29:06,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:29:06,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:29:06,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:29:06,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:29:06,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 11:29:06,584 INFO L478 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 21 treesize of output 17 [2018-11-23 11:29:06,594 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:29:06,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 11:29:06,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:29:06,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:29:06,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:29:06,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:10 [2018-11-23 11:29:06,643 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:29:06,644 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#A~0.base|, main_~i~0]. (let ((.cse1 (bvadd main_~i~0 (_ bv4294967295 32))) (.cse0 (select |#memory_int| |main_~#A~0.base|))) (and (= (select .cse0 (_ bv4092 32)) |main_#t~mem1|) (not (bvslt main_~i~0 (_ bv1024 32))) (bvslt .cse1 (_ bv1024 32)) (= .cse1 (select .cse0 (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))) [2018-11-23 11:29:06,644 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (bvslt (bvadd |main_#t~mem1| (_ bv1 32)) (_ bv1024 32))) (bvslt |main_#t~mem1| (_ bv1024 32))) [2018-11-23 11:29:06,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-23 11:29:06,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {796#true} is VALID [2018-11-23 11:29:06,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-23 11:29:06,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #35#return; {796#true} is VALID [2018-11-23 11:29:06,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret2 := main(); {796#true} is VALID [2018-11-23 11:29:06,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,812 INFO L273 TraceCheckUtils]: 9: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,826 INFO L273 TraceCheckUtils]: 19: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,827 INFO L273 TraceCheckUtils]: 21: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,827 INFO L273 TraceCheckUtils]: 22: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {816#(= (_ bv0 32) |main_~#A~0.offset|)} is VALID [2018-11-23 11:29:06,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {816#(= (_ bv0 32) |main_~#A~0.offset|)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {874#(and (= (_ bv0 32) |main_~#A~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (bvslt main_~i~0 (_ bv1024 32)))} is VALID [2018-11-23 11:29:08,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {874#(and (= (_ bv0 32) |main_~#A~0.offset|) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (bvslt main_~i~0 (_ bv1024 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {878#(and (= (_ bv0 32) |main_~#A~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} is UNKNOWN [2018-11-23 11:29:08,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {878#(and (= (_ bv0 32) |main_~#A~0.offset|) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))} assume !~bvslt32(~i~0, 1024bv32); {882#(and (= (_ bv0 32) |main_~#A~0.offset|) (exists ((main_~i~0 (_ BitVec 32))) (and (not (bvslt main_~i~0 (_ bv1024 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))))} is VALID [2018-11-23 11:29:08,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {882#(and (= (_ bv0 32) |main_~#A~0.offset|) (exists ((main_~i~0 (_ BitVec 32))) (and (not (bvslt main_~i~0 (_ bv1024 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1024 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))))} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {886#(and (not (bvslt (bvadd |main_#t~mem1| (_ bv1 32)) (_ bv1024 32))) (bvslt |main_#t~mem1| (_ bv1024 32)))} is VALID [2018-11-23 11:29:08,851 INFO L256 TraceCheckUtils]: 28: Hoare triple {886#(and (not (bvslt (bvadd |main_#t~mem1| (_ bv1 32)) (_ bv1024 32))) (bvslt |main_#t~mem1| (_ bv1024 32)))} call __VERIFIER_assert((if 1023bv32 == #t~mem1 then 1bv32 else 0bv32)); {890#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:08,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {890#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {894#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:08,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {894#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {797#false} is VALID [2018-11-23 11:29:08,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-23 11:29:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:29:08,874 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:08,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:08,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:29:08,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 11:29:08,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:08,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:29:10,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:10,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:29:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:29:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:29:10,948 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 9 states. [2018-11-23 11:29:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:12,005 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:29:12,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:29:12,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 11:29:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:29:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-11-23 11:29:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:29:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-11-23 11:29:12,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 16 transitions. [2018-11-23 11:29:16,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 14 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:16,105 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:29:16,105 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:29:16,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:29:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:29:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:29:16,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:16,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:16,108 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:16,109 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,109 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:29:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:16,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:16,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:16,110 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:16,110 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:16,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:29:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:16,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:16,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:16,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:16,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:29:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:29:16,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-23 11:29:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:16,112 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:29:16,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:29:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:16,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:16,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:29:16,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:29:16,468 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:29:16,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:29:16,469 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:29:16,469 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:29:16,469 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:29:16,469 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:29:16,469 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 15) the Hoare annotation is: true [2018-11-23 11:29:16,469 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 15) no Hoare annotation was computed. [2018-11-23 11:29:16,470 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (let ((.cse0 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvslt (bvadd |main_#t~mem1| (_ bv1 32)) (_ bv1024 32))) (= (_ bv0 32) |main_~#A~0.offset|) (bvslt .cse0 (_ bv1024 32)) (exists ((main_~i~0 (_ BitVec 32))) (let ((.cse1 (bvadd main_~i~0 (_ bv4294967295 32)))) (and (not (bvslt main_~i~0 (_ bv1024 32))) (bvslt .cse1 (_ bv1024 32)) (= .cse1 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))))) (= .cse0 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (bvslt |main_#t~mem1| (_ bv1024 32)))) [2018-11-23 11:29:16,470 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-23 11:29:16,470 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 15) no Hoare annotation was computed. [2018-11-23 11:29:16,470 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2018-11-23 11:29:16,471 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |main_~#A~0.offset|))) (or (and .cse0 (= main_~i~0 (_ bv0 32))) (let ((.cse1 (bvadd main_~i~0 (_ bv4294967295 32)))) (and .cse0 (bvslt .cse1 (_ bv1024 32)) (= .cse1 (select (select |#memory_int| |main_~#A~0.base|) (bvadd |main_~#A~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))))))) [2018-11-23 11:29:16,472 INFO L448 ceAbstractionStarter]: For program point L11-4(lines 11 13) no Hoare annotation was computed. [2018-11-23 11:29:16,472 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:29:16,472 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 11:29:16,472 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 11:29:16,472 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:29:16,472 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 11:29:16,473 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 11:29:16,475 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:16,477 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:29:16,478 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-23 11:29:16,479 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:29:16,479 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:29:16,479 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:29:16,485 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:29:16,489 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:29:16,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:16 BoogieIcfgContainer [2018-11-23 11:29:16,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:29:16,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:29:16,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:29:16,494 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:29:16,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:01" (3/4) ... [2018-11-23 11:29:16,498 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:29:16,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:29:16,506 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:29:16,506 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:29:16,510 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 11:29:16,511 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 11:29:16,511 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:29:16,557 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/array_true-unreach-call1_true-termination.i-witness.graphml [2018-11-23 11:29:16,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:29:16,558 INFO L168 Benchmark]: Toolchain (without parser) took 15932.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -370.6 MB). Peak memory consumption was 373.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:16,560 INFO L168 Benchmark]: CDTParser took 0.27 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-23 11:29:16,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.22 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-23 11:29:16,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.40 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-23 11:29:16,562 INFO L168 Benchmark]: Boogie Preprocessor took 58.99 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-23 11:29:16,562 INFO L168 Benchmark]: RCFGBuilder took 675.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:16,563 INFO L168 Benchmark]: TraceAbstraction took 14770.81 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: 407.5 MB). Peak memory consumption was 407.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:16,564 INFO L168 Benchmark]: Witness Printer took 63.57 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:16,567 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 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 322.22 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 33.40 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 58.99 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 675.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14770.81 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: 407.5 MB). Peak memory consumption was 407.5 MB. Max. memory is 7.1 GB. * Witness Printer took 63.57 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. 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 * 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 [2018-11-23 11:29:16,575 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:29:16,576 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (0bv32 == A && i == 0bv32) || ((0bv32 == A && ~bvslt32(~bvadd64(i, 4294967295bv32), 1024bv32)) && ~bvadd64(i, 4294967295bv32) == unknown-#memory_int-unknown[A][~bvadd64(A, ~bvmul32(4bv32, i), 4294967292bv32)]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 14.6s OverallTime, 5 OverallIterations, 10 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 21 SDslu, 116 SDs, 0 SdLazy, 128 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 22 NumberOfFragments, 93 HoareAnnotationTreeSize, 11 FomulaSimplifications, 269 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 90 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 117 ConstructedInterpolants, 1 QuantifiedInterpolants, 7441 SizeOfPredicates, 9 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 100/134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...