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_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/rewrev_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:23:10,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:23:10,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:23:10,088 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:23:10,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:23:10,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:23:10,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:23:10,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:23:10,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:23:10,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:23:10,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:23:10,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:23:10,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:23:10,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:23:10,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:23:10,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:23:10,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:23:10,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:23:10,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:23:10,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:23:10,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:23:10,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:23:10,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:23:10,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:23:10,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:23:10,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:23:10,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:23:10,116 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:23:10,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:23:10,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:23:10,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:23:10,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:23:10,119 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:23:10,119 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:23:10,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:23:10,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:23:10,121 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:23:10,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:23:10,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:23:10,137 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:23:10,138 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:23:10,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:23:10,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:23:10,138 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:23:10,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:23:10,139 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:23:10,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:23:10,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:23:10,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:23:10,140 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:23:10,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:23:10,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:23:10,140 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:23:10,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:23:10,141 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:23:10,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:23:10,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:23:10,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:23:10,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:23:10,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:23:10,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:10,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:23:10,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:23:10,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:23:10,142 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:23:10,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:23:10,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:23:10,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:23:10,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:23:10,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:23:10,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:23:10,214 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:23:10,214 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:23:10,215 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewrev_true-unreach-call.i [2018-11-23 12:23:10,281 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de13e796/f594efb5c27c42d0b202dc57936c27e3/FLAG5cf4a85dd [2018-11-23 12:23:10,710 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:23:10,711 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewrev_true-unreach-call.i [2018-11-23 12:23:10,716 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de13e796/f594efb5c27c42d0b202dc57936c27e3/FLAG5cf4a85dd [2018-11-23 12:23:11,082 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de13e796/f594efb5c27c42d0b202dc57936c27e3 [2018-11-23 12:23:11,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:23:11,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:23:11,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:11,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:23:11,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:23:11,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5417f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11, skipping insertion in model container [2018-11-23 12:23:11,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:23:11,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:23:11,386 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:11,392 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:23:11,418 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:11,442 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:23:11,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11 WrapperNode [2018-11-23 12:23:11,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:11,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:11,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:23:11,444 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:23:11,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:11,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:23:11,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:23:11,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:23:11,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (1/1) ... [2018-11-23 12:23:11,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:23:11,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:23:11,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:23:11,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:23:11,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (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 12:23:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:23:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:23:11,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:23:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:23:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:23:11,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:23:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:23:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:23:11,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:23:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:23:11,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:23:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:23:12,148 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:23:12,148 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:23:12,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:12 BoogieIcfgContainer [2018-11-23 12:23:12,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:23:12,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:23:12,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:23:12,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:23:12,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:11" (1/3) ... [2018-11-23 12:23:12,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc94333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:12, skipping insertion in model container [2018-11-23 12:23:12,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:11" (2/3) ... [2018-11-23 12:23:12,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc94333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:12, skipping insertion in model container [2018-11-23 12:23:12,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:12" (3/3) ... [2018-11-23 12:23:12,157 INFO L112 eAbstractionObserver]: Analyzing ICFG rewrev_true-unreach-call.i [2018-11-23 12:23:12,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:23:12,174 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:23:12,192 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:23:12,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:23:12,228 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:23:12,228 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:23:12,228 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:23:12,229 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:23:12,229 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:23:12,229 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:23:12,229 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:23:12,230 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:23:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 12:23:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:23:12,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:12,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:12,260 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:12,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1204506220, now seen corresponding path program 1 times [2018-11-23 12:23:12,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:12,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:12,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:12,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:12,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:12,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 12:23:12,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {31#true} is VALID [2018-11-23 12:23:12,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 12:23:12,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #63#return; {31#true} is VALID [2018-11-23 12:23:12,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2018-11-23 12:23:12,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {31#true} is VALID [2018-11-23 12:23:12,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {31#true} is VALID [2018-11-23 12:23:12,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 12:23:12,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} ~i~0 := 0; {32#false} is VALID [2018-11-23 12:23:12,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32#false} is VALID [2018-11-23 12:23:12,435 INFO L256 TraceCheckUtils]: 10: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {32#false} is VALID [2018-11-23 12:23:12,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 12:23:12,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-23 12:23:12,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 12:23:12,440 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 12:23:12,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:12,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:23:12,450 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:23:12,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:12,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:23:12,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:12,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:23:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:23:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:23:12,555 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 12:23:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:12,842 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-23 12:23:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:23:12,842 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:23:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 12:23:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 12:23:12,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 12:23:13,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:13,247 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:23:13,247 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:23:13,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:23:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:23:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:23:13,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:13,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:23:13,286 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:23:13,287 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:23:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:13,290 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 12:23:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:23:13,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:13,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:13,291 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:23:13,292 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:23:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:13,296 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 12:23:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:23:13,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:13,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:13,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:13,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:23:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 12:23:13,302 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2018-11-23 12:23:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:13,302 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 12:23:13,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:23:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:23:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:23:13,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:13,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:13,304 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:13,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash 142847815, now seen corresponding path program 1 times [2018-11-23 12:23:13,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:13,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:13,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:13,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {165#true} is VALID [2018-11-23 12:23:13,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {165#true} is VALID [2018-11-23 12:23:13,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2018-11-23 12:23:13,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #63#return; {165#true} is VALID [2018-11-23 12:23:13,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret5 := main(); {165#true} is VALID [2018-11-23 12:23:13,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {165#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {165#true} is VALID [2018-11-23 12:23:13,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {165#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {167#(<= 0 main_~i~0)} is VALID [2018-11-23 12:23:13,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {167#(<= 0 main_~i~0)} assume !(~i~0 >= -1); {166#false} is VALID [2018-11-23 12:23:13,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {166#false} ~i~0 := 0; {166#false} is VALID [2018-11-23 12:23:13,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {166#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {166#false} is VALID [2018-11-23 12:23:13,492 INFO L256 TraceCheckUtils]: 10: Hoare triple {166#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {166#false} is VALID [2018-11-23 12:23:13,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {166#false} ~cond := #in~cond; {166#false} is VALID [2018-11-23 12:23:13,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {166#false} assume 0 == ~cond; {166#false} is VALID [2018-11-23 12:23:13,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {166#false} assume !false; {166#false} is VALID [2018-11-23 12:23:13,494 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 12:23:13,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:13,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:23:13,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:23:13,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:13,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:23:13,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:13,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:23:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:23:13,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:23:13,546 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 12:23:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:13,716 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:23:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:23:13,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:23:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 12:23:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 12:23:13,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-23 12:23:14,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:14,043 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:23:14,043 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:23:14,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:23:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:23:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 12:23:14,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:14,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 12:23:14,155 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 12:23:14,155 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 12:23:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:14,158 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 12:23:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:23:14,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:14,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:14,159 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 12:23:14,159 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 12:23:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:14,162 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 12:23:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:23:14,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:14,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:14,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:14,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:23:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 12:23:14,166 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-23 12:23:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:14,166 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 12:23:14,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:23:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:23:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:23:14,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:14,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:14,168 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:14,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1002652542, now seen corresponding path program 1 times [2018-11-23 12:23:14,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:14,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:14,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2018-11-23 12:23:14,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {309#true} is VALID [2018-11-23 12:23:14,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-23 12:23:14,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #63#return; {309#true} is VALID [2018-11-23 12:23:14,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2018-11-23 12:23:14,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {309#true} is VALID [2018-11-23 12:23:14,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {309#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {309#true} is VALID [2018-11-23 12:23:14,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {309#true} assume !!(~i~0 >= -1); {309#true} is VALID [2018-11-23 12:23:14,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {309#true} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {311#(<= 0 main_~i~0)} is VALID [2018-11-23 12:23:14,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {311#(<= 0 main_~i~0)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {311#(<= 0 main_~i~0)} is VALID [2018-11-23 12:23:14,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {311#(<= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {312#(<= 0 (+ main_~i~0 1))} is VALID [2018-11-23 12:23:14,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {312#(<= 0 (+ main_~i~0 1))} assume !(~i~0 >= -1); {310#false} is VALID [2018-11-23 12:23:14,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {310#false} ~i~0 := 0; {310#false} is VALID [2018-11-23 12:23:14,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {310#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {310#false} is VALID [2018-11-23 12:23:14,339 INFO L256 TraceCheckUtils]: 14: Hoare triple {310#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {310#false} is VALID [2018-11-23 12:23:14,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {310#false} ~cond := #in~cond; {310#false} is VALID [2018-11-23 12:23:14,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {310#false} assume 0 == ~cond; {310#false} is VALID [2018-11-23 12:23:14,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {310#false} assume !false; {310#false} is VALID [2018-11-23 12:23:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:23:14,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:14,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:23:14,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:23:14,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:14,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:23:14,398 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 12:23:14,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:23:14,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:23:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:14,399 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2018-11-23 12:23:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:14,632 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-23 12:23:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:23:14,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:23:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:23:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:23:14,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-23 12:23:14,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:14,739 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:23:14,739 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:23:14,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:23:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:23:14,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:14,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:23:14,761 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:23:14,762 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:23:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:14,764 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:23:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:23:14,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:14,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:14,765 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:23:14,765 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:23:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:14,768 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:23:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:23:14,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:14,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:14,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:14,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:23:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:23:14,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-23 12:23:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:14,772 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:23:14,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:23:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:23:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:23:14,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:14,774 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:14,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:14,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1636198789, now seen corresponding path program 1 times [2018-11-23 12:23:14,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:14,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:14,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:14,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:14,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:15,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 12:23:15,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {457#true} is VALID [2018-11-23 12:23:15,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 12:23:15,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #63#return; {457#true} is VALID [2018-11-23 12:23:15,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2018-11-23 12:23:15,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {457#true} is VALID [2018-11-23 12:23:15,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {459#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {460#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {461#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (< 0 (+ (* 4 main_~i~0) |main_~#a~0.offset| 5)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {461#(and (or (<= (+ main_~low~0 1) main_~val2~0) (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0))) (< 0 (+ (* 4 main_~i~0) |main_~#a~0.offset| 5)) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= 0); {462#(and (<= (+ main_~low~0 1) main_~val2~0) (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {462#(and (<= (+ main_~low~0 1) main_~val2~0) (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {463#(and (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {463#(and (= (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) 0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {464#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= -1); {464#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {464#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {465#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:15,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {465#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {466#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:23:15,772 INFO L256 TraceCheckUtils]: 18: Hoare triple {466#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {467#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:23:15,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {468#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:23:15,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {468#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {458#false} is VALID [2018-11-23 12:23:15,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 12:23:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:23:15,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:15,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:15,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:15,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:16,172 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 16 treesize of output 13 [2018-11-23 12:23:16,177 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 13 treesize of output 12 [2018-11-23 12:23:16,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:16,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:16,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:23:16,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-11-23 12:23:16,258 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:16,258 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, main_~i~0, main_~val2~0]. (and (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= main_~low~0 2) (< main_~i~0 0) (= (store |v_#memory_int_8| |main_~#a~0.base| (store (select |v_#memory_int_8| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) main_~val2~0)) |#memory_int|) (= |main_~#a~0.offset| 0)) [2018-11-23 12:23:16,259 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (and (<= 0 (+ main_~i~0 1)) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0) (= |main_~#a~0.offset| 0)) [2018-11-23 12:23:16,902 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 19 treesize of output 15 [2018-11-23 12:23:16,910 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:23:16,913 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-23 12:23:16,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:16,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:16,950 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 12:23:16,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2018-11-23 12:23:16,953 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:16,953 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, v_prenex_1]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (<= main_~low~0 2) (< v_prenex_1 0) (<= 0 (+ v_prenex_1 1)) (<= 3 (select .cse0 (+ (* 4 v_prenex_1) 4))) (<= (select .cse0 0) |main_#t~mem4|))) [2018-11-23 12:23:16,953 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:23:17,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 12:23:17,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {457#true} is VALID [2018-11-23 12:23:17,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 12:23:17,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #63#return; {457#true} is VALID [2018-11-23 12:23:17,103 INFO L256 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2018-11-23 12:23:17,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {457#true} is VALID [2018-11-23 12:23:17,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {490#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {506#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {506#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= 0); {510#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (< main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {510#(and (<= 0 (+ main_~i~0 1)) (<= 3 main_~val2~0) (<= main_~low~0 2) (< main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {514#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {514#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {514#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {514#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= -1); {514#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {514#(and (exists ((main_~i~0 Int)) (and (<= 0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (< main_~i~0 0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {524#(and (exists ((v_prenex_1 Int)) (and (< v_prenex_1 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset| 4))) (<= 0 (+ v_prenex_1 1)))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:17,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {524#(and (exists ((v_prenex_1 Int)) (and (< v_prenex_1 0) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset| 4))) (<= 0 (+ v_prenex_1 1)))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {528#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:23:17,133 INFO L256 TraceCheckUtils]: 18: Hoare triple {528#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {467#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:23:17,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {467#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {468#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:23:17,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {468#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {458#false} is VALID [2018-11-23 12:23:17,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 12:23:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:23:17,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:17,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-11-23 12:23:17,165 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-23 12:23:17,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:17,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:23:17,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:17,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:23:17,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:23:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:23:17,247 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2018-11-23 12:23:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:18,578 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:23:18,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:23:18,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-23 12:23:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:23:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 12:23:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:23:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 12:23:18,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2018-11-23 12:23:18,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:18,668 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:23:18,668 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:23:18,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:23:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:23:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-23 12:23:18,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:18,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-23 12:23:18,768 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-23 12:23:18,768 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-23 12:23:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:18,771 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 12:23:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:23:18,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:18,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:18,773 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-23 12:23:18,773 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-23 12:23:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:18,776 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 12:23:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 12:23:18,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:18,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:18,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:18,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:23:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 12:23:18,780 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-11-23 12:23:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:18,781 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 12:23:18,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:23:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:23:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:23:18,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:18,788 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:18,788 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:18,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:18,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1656033490, now seen corresponding path program 1 times [2018-11-23 12:23:18,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:18,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:18,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:19,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2018-11-23 12:23:19,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {724#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {724#true} is VALID [2018-11-23 12:23:19,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2018-11-23 12:23:19,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #63#return; {724#true} is VALID [2018-11-23 12:23:19,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret5 := main(); {724#true} is VALID [2018-11-23 12:23:19,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {724#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {724#true} is VALID [2018-11-23 12:23:19,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {724#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 7;~low~0 := 2;~i~0 := ~SIZE~0 - 2; {726#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {726#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {726#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {726#(and (<= (+ main_~low~0 1) main_~val2~0) (= |main_~#a~0.offset| 0))} assume ~i~0 >= 0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {727#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {727#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {728#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 0 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {729#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {729#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 >= -1); {729#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {729#(and (<= 0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) main_~val2~0) (or (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (<= 0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= 0); {730#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0) 4) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {731#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {731#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {731#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {731#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 >= -1); {731#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {731#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,650 INFO L256 TraceCheckUtils]: 18: Hoare triple {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {724#true} is VALID [2018-11-23 12:23:19,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {724#true} ~cond := #in~cond; {733#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:23:19,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {733#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {734#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:19,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {734#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {734#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:19,652 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {734#(not (= |__VERIFIER_assert_#in~cond| 0))} {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #67#return; {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {732#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {735#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:19,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {735#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {736#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:23:19,657 INFO L256 TraceCheckUtils]: 26: Hoare triple {736#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {734#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:19,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {734#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {737#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:23:19,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {737#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {725#false} is VALID [2018-11-23 12:23:19,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {725#false} assume !false; {725#false} is VALID [2018-11-23 12:23:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:23:19,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:19,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:19,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:19,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:19,889 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 16 treesize of output 13 [2018-11-23 12:23:19,898 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 13 treesize of output 12 [2018-11-23 12:23:19,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:19,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:19,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:19,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 12:23:20,174 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 38 treesize of output 31 [2018-11-23 12:23:20,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:20,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 48 [2018-11-23 12:23:20,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:20,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:20,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:23:20,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-23 12:23:20,225 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:20,226 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, v_main_~i~0_15, main_~i~0]. (let ((.cse0 (select |v_#memory_int_10| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)))) (and (= (store |v_#memory_int_10| |main_~#a~0.base| (store .cse0 (+ (* 4 main_~i~0) |main_~#a~0.offset| 4) .cse1)) |#memory_int|) (<= main_~low~0 2) (<= 3 .cse1) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0)))) [2018-11-23 12:23:20,226 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_15, main_~i~0]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (+ (* 4 v_main_~i~0_15) |main_~#a~0.offset| 4)))) (and (<= main_~low~0 2) (= .cse0 (select .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset| 4))) (<= 0 v_main_~i~0_15) (<= v_main_~i~0_15 (+ main_~i~0 1)) (< main_~i~0 0) (<= 3 .cse0)))) [2018-11-23 12:23:25,432 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:25,434 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.CommuhashNormalForm.transform(CommuhashNormalForm.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:325) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 37 more [2018-11-23 12:23:25,439 INFO L168 Benchmark]: Toolchain (without parser) took 14347.12 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 846.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -879.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:23:25,441 INFO L168 Benchmark]: CDTParser took 0.24 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 12:23:25,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.15 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 12:23:25,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.90 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 12:23:25,443 INFO L168 Benchmark]: Boogie Preprocessor took 32.41 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 12:23:25,443 INFO L168 Benchmark]: RCFGBuilder took 646.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -731.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:23:25,444 INFO L168 Benchmark]: TraceAbstraction took 13287.96 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 147.8 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -159.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:23:25,451 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.24 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. * CACSL2BoogieTranslator took 349.15 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 25.90 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 32.41 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 646.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -731.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13287.96 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 147.8 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -159.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...